*AIM1|AIM-1*MCCARTHY, PREDICATE CALCULUS WITH UNDEFINED AS A TRUTH-VALUE|2|0|$ 1.85
*AIM2|AIM-2*MCCARTHY, SITUATIONS, ACTIONS, AND CAUSAL LAWS|0|0|$ 2.00
*AIM3|AIM-3*SAFIER, THE MIKADO AN AN ADVICE TAKER PROBLEM|0|0|$ 1.80
*AIM4|AIM-4*ENEA, CLOCK FUNCTION FOR LISP 1.5|0|0|$ .00
*AIM5|AIM-5*ENEA, WOOLDRIDGE, ALGEBRAIC SIMPLICATION|0|0|$ 1.75
*AIM6|AIM-6*WOOLDRIDGE, NON-PRINTING COMPILER|0|0|$ .00
*AIM7|AIM-7*MCCARTHY, PROGRAMS WITH COMMON SENSE|0|0|$ 1.90
*AIM8|AIM-8*MCCARTHY, STORAGE CONVENTIONS IN LISP 2|0|0|$ .00
*AIM9|AIM-9*WILLIAMS, COMPT EST FOR NO OF BISECTION OF AN NXN CHECKBD FOR N EVEN|0|0|$ .00
*AIM10|AIM-10*RUSSELL, IMPROVEMENTS IN LISP DEBUGGING|0|0|$ 1.80
*AIM11|AIM-11*WOOLDRIDGE, AN ALGEBRAIC SIMPLIFY PROGRAM IN LISP|0|0|$ .00
*AIM12|AIM-12*FELDMAN, DOCUMENTATION OF THE MACMAHON SQUARES PROBLEM|0|0|$ .00
*AIM13|AIM-13*WOOLDRIDGE, THE NEW LISP SYSTEM (LISP 1.55)|0|0|$ 1.80
*AIM14|AIM-14*MCCARTHY,COMPUTER CONTROL OF A MACHINE FOR EXPLORING MARS|0|0|$ 1.85
*AIM15|AIM-15*FINKELSTEIN, SAFIER, AXIOMATIZATION & IMPLEMENTATION|0|0|$ 1.85
*AIM16|AIM-16*MCCARTHY, A TOUGH NUT FOR PROOF PROCEDURES|0|0|$ 1.80
*AIM17|AIM-17*MCCARTHY, FOR DESCRIP. OF THE GAME OF PANG-KE|0|0|$ 1.75
*AIM18|AIM-18*HEXT, AN EXPRESSION INPUT ROUTINE FOR LISP|0|0|$ 1.85
*AIM19|AIM-19*HEXT, PROGRAMMING LANGUAGES & TRANSLATION|2|0|$ 2.10
*AIM20|AIM-20*REDDY, SOURCE LANGUAGE OPTIMIZATION OF FOR-LOOPS|1|0|$ 2.40
*AIM21|AIM-21*MITCHELL, LISP 2 SPECIFICATIONS PROPOSAL|68|0|$ 2.05
*AIM22|AIM-22*RUSSELL, KALAH-THE GAME & THE PROGRAM|22|0|$ 2.05
*AIM23|AIM-23*RUSSELL, IMPROVEMENTS TO THE KALAH PROGRAM|49|0|$ 2.05
*AIM24|AIM-24*MCCARTHY, A FORMAL DESCRIPTION OF A SUBSET OF ALGOL|56|0|$ 2.90
*AIM25|AIM-25*MANSFIELD, A FORMAL SYSTEM OF COMPUTATION|41|0|$ 1.90
*AIM26|AIM-26*REDDY, EXPERIM.ON AUTO.SPEECH RECOGN.BY A DIGITAL COMPUTER|26|0|$ 2.25
*AIM27|AIM-27*MCCARTHY, PROOF-CHECKER FOR PREDICATE CALCULUS|53|0|$ 1.90
*AIM28|AIM-28*MCCARTHY|0|6|$ 1.90
*AIM29|AIM-29*WILLIAMS, ISOLATION IMPRTNT FEATURES OF MULTITONED PICTURE|1|0|$ 2.00
*AIM30|AIM-30*FEIGENBAUM,WATSON,INIT.PROB.STATEM.FOR MACHINE INDUCT.RES.|0|0|$ 1.95
*AIM31|AIM-31*MCCARTHY, PLANS FOR THE STANFORD A.I. PROJECT|0|0|$ 2.20
*AIM32|AIM-32*RATCHFORD, THE 138 ANALOG DIGITAL CONVERTER|0|0|$ 1.95
*AIM33|AIM-33*HUBERMAN, THE ADVICE TAKER & GPS|15|0|$ 1.95
*AIM34|AIM-34*CARAH, A TV CAMERA INTERFACE FOR THE PDP-1|86|0|$ 1.95
*AIM35|AIM-35*SAFIER, SIMPLE SIMON|0|0|$ .00
*AIM36|AIM-36*PAINTER, UTILIZATION OF A TV CAMERA ON THE PDP-1|69|0|$ 1.85
*AIM37|AIM-37*KORSVOLD, AN ON LINE ALGEBRAIC SIMPLIFICATION PROGRAM|0|0|$ .00
*AIM38|AIM-38*WATERMAN, A FILTER FOR A MACHINE INDUCTION SYSTEM|57|0|$ 2.25
*AIM39|AIM-39*PINGLE, PROGRAM TO FIND OBJECTS IN A PICTURE|33|0|$ 2.30
*AIM41|AIM-41*ABRAMS, RODE, PROP.FOR PROOF-CHECK.FOR CERTAIN AXIOM SYS.|0|0|$ .00
*AIM42|AIM-42*PINGLE, PROPOSAL FOR A VISUAL INPUT ROUTINE|69|0|$ 2.00
*AIM44|AIM-44*PAINTER, SEM.CORRECT COMPLR FOR ALGOL-LIKE LANG(THESIS)|0|0|$ .00
*AIM45|AIM-45*KAPLAN, SOME COMPLET.RESULT IN MATH. THEORY OF COMP.|68|0|$ 2.30
*AIM47|AIM-47*BUCHANAN, LOGICS OF SCIENTIFIC DISCOVERY|0|0|$ .00
*AIM48|AIM-48*KAPLAN, CORRECTNESS OF COMPILER FOR ALGOL-LIKE PROGRAMS|25|0|$ 3.00
*AIM49|AIM-49*SUTHERLAND, DENDRAL-COMP.PROG.FOR GENER. & FILTER CHEMICAL|27|0|$ 2.65
*AIM50|AIM-50*HEARN, REDUCE USERS' MANUAL|1|0|$ 3.20
*AIM51|AIM-51*EARNEST, CHOOSING AN EYE FOR A COMPUTER|42|0|$ 6.00
*AIM52|AIM-52*SAMUEL, STUDIES IN MACHINE LEARN USING GAME CHECKERS II|12|0|$ 3.05
*AIM53|AIM-53*WEIHER, THE PDP-6 PROOF CHECKER|16|0|$ 3.00
*AIM54|AIM-54*LEDERBERG, FEIGENBAUM, MECH.OF INDUCT.INFER.ORGANIC CHEM|0|0|$ 2.60
*AIM55|AIM-55*FELDMAN, FIRST THOUGHTS OF GRAMMATICAL INFERENCE|11|0|$ 2.20
*AIM56|AIM-56*WICHMAN, OPTICAL FEEDBACK IN COMP.CONT. OF ARM-THESIS|82|0|$ 3.65
*AIM57|AIM-57*HEARN, REDUCE,USER-ORIENT INTERACT.SYS.ALGEBRA SIMP.|57|0|$ 3.65
*AIM58|AIM-58*CALLERO, ADAPT.COMMAND & CONT.SYS.UTIL.HEUR.LEARN(THESIS)|0|0|$ .00
*AIM59|AIM-59*KAPLAN, FORMAL THEORY CONCERN THE EQUIVALENCE OF ALGORITHMS|1|0|$ 2.30
*AIM60|AIM-60*KAPLAN, FORMAL THEORY ANLSIS STRNG EQUIV ELEMT PROG-THESIS|13|0|$ 9.05
*AIM61|AIM-61*ITO, NOTES ON THEORY COMPUTATION & PATTERN RECOGN|0|0|$ 5.75
*AIM62|AIM-62*BUCHANAN, SUTHERLAND, HEURISTIC DENDRAL|0|0|$ .00
*AIM63|AIM-63*KAPLAN, REG. EXPRESS. & THE EQUIVALANCE OF PROGRAMS|3|0|$ 2.90
*AIM64|AIM-64*MANNA, FORMALIZATION OF PROPERTIES OF PROGRAMS|0|0|$ .00
*AIM66|AIM-66*FELDMAN, ROVNER, AN ALGOL-BASED ASSOCIATIVE LANGUAGE|0|0|$ .00
*AIM67|AIM-67*FEIGENBAUM, A.I.: THEMES IN THE SECOND DECADE|0|0|$ .00
*AIM68|AIM-68*MANNA, PNUELI, VALIDITY PROBLEM OF 91-FUNCTION|17|0|$ 2.25
*AIM69|AIM-69*MCCARTHY ET AL, PROJECT TECHNICAL REPORT|1|0|$ 4.40
*AIM70|AIM-70*HEARN, THE PROBLEM OF SUBSTITUTION|23|0|$ 2.10
*AIM71|AIM-71*VICENS, PREPROCESSING FOR SPEECH ANALYSIS|0|0|$ 2.70
*AIM73|AIM-73*MCCARTHY, HAYES, PHILOSPCL.PROB.FROM STANDPT. OF A.I.|0|0|$ 3.25
*AIM75|AIM-75*SCHANK, NOTION LING CONCEPT:PRELUDE TO MECH TRANSLATION|0|0|$ .00
*AIM76|AIM-76*SCHANK, CONCEPTUAL PARSER FOR NATURAL LANGUAGE|0|0|$ .00
*AIM77|AIM-77*BECKER, MDL SMPL ANAL & INDCTVE PROCES SEMANTIC MEMORY SYS|0|0|$ 2.30
*AIM78|AIM-78*REDDY, USE ENVRMTL SNTC & PRBLSTC CONSTRNT IN VSN & SPEECH|2|0|$ 2.35
*AIM79|AIM-79*REDDY, NEELY, CONTXTAL ANALYSIS OF PHONEMES OF ENGLISH|12|0|$ 3.70
*AIM80|AIM-80*SUTHERLAND, HEURISTIC DENDRAL: A FAMILY OF LISP PROGRAMS|0|0|$ .00
*AIM81|AIM-81*LUCKHAM, REFINEMENT THEOREMS IN RESOLUTION THEORY|0|0|$ .00
*AIM82|AIM-82*MANNA, FRMLZTN PROPERTIES OF RECURSVLY DEFINED FUNCTIONS|0|0|$ .00
*AIM84|AIM-84*SMITH, MLISP USERS'S MANUAL|0|0|$ .00
*AIM86|AIM-86*HAYES, MACHINE-ORIENT FRMLTN OF EXTND FNCTNL CALCULUS|0|0|$ .00
*AIM87|AIM-87*MCCARTHY ET AL, PROJECT TECHNICAL REPORT|0|0|$ .00
*AIM88|AIM-88*SCHANK, LINGUISTICS FROM A CONCEPTUAL VIEWPOINT|0|0|$ .00
*AIM90|AIM-90*HEARN, STANDARD LISP|0|0|$ .00
*AIM91|AIM-91*CAMPBELL, HEARN, SMBLC ANLSIS OF FEYNMAN DIAGRAMS BY CMPTR|1|0|$ 3.75
*AIM92|AIM-92*SCHEINMAN, DESIGN OF A COMPUTER CONTROLLED MANIPULATOR|0|0|$ .00
*AIM93.1|AIM-93.1*FELDMAN, DCDBLTY RSLTS ON GRMTCL INFRNCE & CMPLITY|15|0|$ 2.55
*AIM94|AIM-94*COLBY ET AL, EXPRMT W/SRCH ALGRTM ON DTA BASE HUMAN BLF STR|1|0|$ 2.50
*AIM95|AIM-95*MANNA, CORRECTNESS OF NON-DETERMINISTIC PROGRAMS|0|0|$ .00
*AIM97|AIM-97*COLBY, SMITH, DILGS BTWN HMNS & ARTFCL BLF SYS|3|0|$ 2.50
*AIM99|AIM-99*BUCHANAN ET AL, UNDERSTNDG INFO PROCS SCI INFR IN ORGC CHEM|0|0|$ .00
*AIM100|AIM-100*MANNA, MCCARTHY, PROP OF PROGRAMS & PARTIAL FNTN LOGIC|0|0|$ 2.30
*AIM101|AIM-101*PAUL ET AL, COMPTR RPRSNTATN OF SMPLY DSCRBD SCENES|0|0|$ .00
*AIM102|AIM-102*WATERMAN, GNRLZTN LEARN FOR AUTO LEARN OF HEURISTICS|0|0|$ 3.95
*AIM103|AIM-103*ALLEN, LUCKHAM, INTERACTIVE THEOREM-PROVE PROGRAM|22|0|$ 2.45
*AIM104|AIM-104*LEDERBERG ET AL, HRSTC PRGRM SOLV SCI INFRNCE PRBLM|22|0|$ 2.15
*AIM105|AIM-105*HEUCKEL, OPRTR WHICH LOCTS EDGES IN DGTZD PICTURES|0|0|$ .00
*AIM106|AIM-106*KAHN,NEAR-MIN-TIME CNTRL OPN-LOOP ART KINMTC CHNS-THESIS|0|0|$ 6.50
*AIM107|AIM-107*FALK, IMPLCTNS OF PLANARITY FOR MACHINE PERCEPTION|0|0|$ 2.50
*AIM108|AIM-108*KELLY, EDGE DTCTN IN PCTRS BY CMPTR USING PLNG|0|0|$ .00
*AIM109|AIM-109*SCHANK ET AL, SPINOZA II: CNCPTAL CASE-BASE NTRL LANG ANLS|0|0|$ .00
*AIM110|AIM-110*ASHCROFT, MANNA, FORMALIZATION OF PARALLEL PROG PROPS|0|0|$ .00
*AIM111|AIM-111*MANNA,SECOND-ORDER MATH THEORY OF COMPUTATION|0|0|$ 2.45
*AIM112|AIM-112*HILF ET AL, MACHINE-MEDIATED INTERVIEWING|0|0|$ .00
*AIM113|AIM-113*COLBY ET AL, MUTE PATIENT EXPERIENCE W/MACHINE INTERVIEW|0|0|$ .00
*AIM114|AIM-114*BIERMANN, FELDMAN, SYNTHESIS OF FINITE-STATE ACCEPTORS|0|0|$ .00
*AIM115|AIM-115*MONTANARI, OPTIMAL DETECTION OF CRVS IN NOISY PCTRS|34|0|$ 2.70
*AIM116|AIM-116*COLBY, MIND & BRAIN, AGAIN|0|0|$ .00
*AIM117|AIM-117*MCCARTHY ET AL, PROJECT TECHNICAL REPORT|0|0|$ 3.95
*AIM118|AIM-118*MONTANARI, HURSTCLY GUIDED SEARCH & CHROMOSOME MATCH|22|0|$ 2.50
*AIM119|AIM-119*BECKER, INFO-PROCES MODEL OF INTRMEDAT-LVL COGNITION-THESIS|0|0|$ .00
*AIM120|AIM-120*COLBY, SMITH, CPTR CTLST TREATMT OF NNSPKG AUTISTIC CHILD|4|0|$ 2.60
*AIM121|AIM-121*SOBEL, CAMERA MODELS & MACHINE PERCEPTION-THESIS|0|0|$ .00
*AIM122|AIM-122*SCHANK, `SEMANTICS' IN CONCEPTUAL ANALYSIS|0|0|$ .00
*AIM123|AIM-123*BUCHANAN ET AL, SPCLATN ABOUT A.I. & LEGAL RESNG|0|0|$ 3.20
*AIM124|AIM-124*ASTRAHAN, SPECH ANALS BY CLUSTRG, OR HYPERPHONEME MTHD|48|0|$ 2.30
*AIM125|AIM-125*COLBY ET AL, ARTIFICIAL PARANOIA|4|0|$ 2.75
*AIM149|AIM-149*SCHMIDT,REAL-TIME CONTROL OF A COMPUTER DRIVEN VEHICLE|103|0|$ 6.75
*AIM150|AIM-150*FLOYD, TOWARD INTERACTIVE DESIGN OF CORRECT PROGRAMS|0|0|$ 2.05
*CS1|STAN-CS-63-001*ROSEN,PRIMAL PARTITION PROGRAMMING|0|0|$ .00
*CS2|STAN-CS-63-002*PAVKOVICH,SSLUTION ALGEBRAIC SYSTEMS|0|0|$ .00
*CS3|STAN-CS-64-003*FORSYTHE,THEOREMS BY SAULEV|0|0|$ .00
*CS4|STAN-CS-64-004*BERGMAN,HERRIOT,NUMER SOLN BDRY VALUE BY INT OPERS|1|0|$ 2.40
*CS5|STAN-CS-64-005*ROSEN,EQUIL PTS FOR CONCAVE N-PERSON GAMES|1|0|$ 2.55
*CS6|STAN-CS-64-006*HOCKNEY,SOLUTION POISSON'S EQUATION|0|0|$ .00
*CS7|STAN-CS-64-007*ROSEN,SUFF.COND.OPT.CONTROL CONVEX PROC.|0|0|$ 2.60
*CS8|STAN-CS-64-008*GOLUB & KAHAN,CALCULATING SINGULAR VALUES|0|0|$ .00
*CS9|STAN-CS-64-009*ANDERSON,Q-D ALGORITHM|0|0|$ .00
*CS10|STAN-CS-64-010*CAUSEY,NORMAL MATRICES(THESIS)|0|0|$ .00
*CS11|STAN-CS-64-011*NAKAMURA,ROSEN,ELASTIC-PLASTIC ANAL OF TRUSSES|1|0|$ 2.65
*CS12|STAN-CS-64-12*GOLUB & BUSINGER,NUMERICAL METHODS|0|0|$ .00
*CS13|STAN-CS-64-013*PEREYRA,ROSEN,COMPUT.OF PSEUDOINVERSE|0|0|$ 2.55
*CS14|STAN-CS-64-014*EFIMENKO,EIGENVALUES AND EIGENFUNCTIONS IN PDE|1|0|$ 2.30
*CS15|STAN-CS-65-015*GRACE,NON-ISOMORPHIC CONVEX POLYHEDRA|0|0|$ 5.80
*CS16|STAN-CS-65-016*FORSYTHE & GOLUB,MAXIMIZING 2ND DEGREE POLYNOMIAL|0|0|$ .00
*CS17|STAN-CS-65-017*FORSYTHE,WIRTH,AUTOMATIC GRADING PROGRAMS|1|0|$ 2.20
*CS18|STAN-CS-65-018*PEREYRA,DIFFERENCE CORRECTION METHOD|0|0|$ .00
*CS19|STAN-CS-65-019*AGEEV,MACLAREN,RUSSIAN ALGOL IN ENGLISH|1|0|$ 1.90
*CS20|STAN-CS-65-020*WIRTH & WEBER,EULER:ALGOL & DEFINITION|0|0|$ .00
*CS21|STAN-CS-65-021*FISHER ET AL,VECTORCARDIOGRAPHIC ANALYSIS|0|0|$ .00
*CS22|STAN-CS-65-022*MOLER,FINITE DIFFERENCE METHODS|0|0|$ .00
*CS23|STAN-CS-65-023*RUDIN,CONVEX POLYNOMIAL APPROXIMATION|2|0|$ 3.00
*CS24|STAN-CS-65-024*KLYUYEV ET AL.,LINEAR ALGEBRAIC SYSTEMS|0|0|$ .00
*CS25|STAN-CS-65-025*HODGE,YIELD-PT LOAD BY NONLINEAR PROGRAMMING|2|0|$ 2.40
*CS26|STAN-CS-65-026*FORSYTHE,S.U. PROGRAM IN COMP. SCI.|0|0|$ .00
*CS27|STAN-CS-65-027*VOLKOV,METHOD OF NETS FOR POISSON EQUATION|0|0|$ 2.60
*CS28|STAN-CS-65-028*MILLER,STRANG,MATRIX THMS FOR PDE'S|0|0|$ 2.70
*CS29|STAN-CS-65-029*PEREYRA,IMPROVING APPROXIMATE SOLUTION|0|0|$ .00
*CS30|STAN-CS-65-030*MARCHUK,AUTOMATIC CONSTRUCTION ALGORITHMS|0|0|$ .00
*CS31|STAN-CS-65-031*RAVIART,WEAK SOLS LINEAR PARABOLIC EQNS|1|0|$ 3.35
*CS32|STAN-CS-65-032*HOCKNEY,MINIMUM MULTIPLICATION FOURIER ANAL|0|0|$ 3.30
*CS33|STAN-CS-65-033*WIRTH,PROG LANG FOR 360 COMPUTERS|0|0|$ .00
*CS34|STAN-CS-66-034*VARAH,EIGENVECTORS OF REAL MATRIX|0|0|$ .00
*CS35|STAN-CS-66-035*WIRTH & HOARE,DEVELOPMENT OF ALGOL|0|0|$ .00
*CS36|STAN-CS-66-036*TRAUB,CALCULATION OF ZEROS|0|0|$ .00
*CS37|STAN-CS-66-037*REYNOLDS,COGENT 1.2 OPERATIONS MANUAL|4|0|$ 2.70
*CS38|STAN-CS-66-038*MCCARTHY,PAINTER,CORRECTNESS OF A COMPILER|0|298|$ 2.10
*AIM40|SAME
*CS39|STAN-CS-66-039*FORSYTHE,HOW DO YOU SOLVE EQUATION?|0|0|$ .00
*CS40|STAN-CS-66-040*FORSYTHE,HOW DO YOU SOLVE EQUATION?|0|0|$ .00
*CS41|STAN-CS-66-041*KAHAN,ACCURATE EIGENVALUES|0|0|$ .00
*CS42|STAN-CS-66-042*KAHAN,WHEN NEGLECT OFF-DIAG ELTS SYMM TRI-DIAG MTX|2|0|$ 2.00
*CS43|STAN-CS-66-043*VARAH & KAHAN,TWO WORKING ALGORITHMS|0|0|$ .00
*CS44|STAN-CS-66-44*KAHAN,RELAXATION METHODS|0|0|$ .00
*CS45|STAN-CS-66-045*KAHAN, RELAXATION METHODS SEMI-DEFINITE|0|0|$ .00
*CS46|STAN-CS-66-046*FORSYTHE,COMPUTATIONAL METHODS|0|0|$ .00
*CS47|STAN-CS-66-047*ABRAMS,"IVERSON NOTATION"|0|0|$ .00
*CS48|STAN-CS-66-048*MCKEEMAN,COMPUTER LANG DESIGN(THESIS)|0|0|$ .00
*CS49|STAN-CS-66-049*REDDY,COMPUTER SPEECH RECOGNITION|0|300|$ 6.00
*AIM43|SAME
*CS50|STAN-CS-66-050*PERSSON,SEQUENCE EXTRAPOLATING PROGRAMS|0|300|$ 7.00
*AIM46|SAME
*CS51|STAN-CS-66-051*BERGMAN,HERRIOT,KURTZ,TRANSONIC FLOW PATTERNS|4|0|$ 2.75
*CS52|STAN-CS-66-052*SHAW,SYSTEMS PROGRAMMING|0|0|$ .00
*CS53|STAN-CS-66-053*WIRTH,PROG LANG FOR 360 COMPUTERS|0|0|$ .00
*CS54|STAN-CS-67-054*GOLUB & ROBERTSON,BAIRSTOW ALGORITHM|0|0|$ .00
*CS55|STAN-CS-67-055*ADAMS,STOPPING CRITERION FOR POLYN.ROOT-FINDING|3|0|$ 2.05
*CS56|STAN-CS-67-056*BAUER,QD-METHOD WITH NEWTON SHIFT|2|0|$ 1.90
*CS57|STAN-CS-67-057*GRIES,TRANSITION MATRICES|0|0|$ .00
*CS58|STAN-CS-67-058*TIXIER,RECURSIVE FUNCTIONS(THESIS)|0|0|$ .00
*CS59|STAN-CS-67-059*WILKINSON,ALMOST DIAGONAL MATRICES|0|0|$ .00
*CS60|STAN-CS-67-060*WILKINSON,TWO ALGORITHMS LINEAR INTERPOLATION|0|0|$ .00
*CS61|STAN-CS-67-061*FORSYTHE,ASYMPTOTIC DIRECTIONS S-DIMENSIONAL|0|0|$ .00
*CS62|STAN-CS-67-062*TIENARI,VARYING LENGTH FLOATING-PT ARITH|0|0|$ 2.85
*CS63|STAN-CS-67-063*POLYA,GRAEFE'S METHOD EIGENVALUES|0|0|$ .00
*CS64|STAN-CS-67-064*RICHMAN,FLOATING-PT NUMBER REPRESENTATIONS|1|0|$ 2.65
*CS65|STAN-CS-67-065*WIRTH,BASIC CONCEPTS PROG LANGUAGES|0|0|$ .00
*CS66|STAN-CS-67-067*BARTELS & GOLUB,CHEBYSHEV SOLUTIONS LINEAR EQUATIONS|0|0|$ .00
*CS67|STAN-CS-67-067*BARTELS & GOLUB,CHEBYSHEV SOLUTIONS LINEAR EQUATIONS|0|0|$ .00
*CS68|STAN-CS-67-068*WIRTH,PL 360 SYSTEM|0|0|$ .00
*CS69|STAN-CS-67-070*FELDMAN & GRIES,TRANSLATOR WRITING SYSTEMS|0|0|$ .00
*CS70|STAN-CS-67-70*BERGMAN ET AL,COMPUTATION FLOW PATTERNS|0|0|$ .00
*CS71|STAN-CS-67-071*JENKINS,TRAUB,AUTOMATIC POLYNOMIAL SOLVER|3|0|$ 2.85
*CS72|STAN-CS-67-072*GOLUB,SMITH,CHEBYSHEV APPROX BY CHEBYSHEV SYSTS|3|0|$ 3.30
*CS73|STAN-CS-67-073*BUSINGER & GOLUB,LEAST SQUARES|0|0|$ .00
*CS74|STAN-CS-67-074*FORSYTHE,WHAT IS SATISFACTORY QUAD-EQ SOLVER?|2|0|$ 2.00
*CS75|STAN-CS-67-075*BAUER,THEORY OF NORMS|0|0|$ .00
*CS76|STAN-CS-67-076*ANSELONE,COLLECTIVELY COMPACT OPERATOR APPROX.|2|0|$ 3.50
*CS77|STAN-CS-67-77*FORSYTHE,WHAT TO DO  TILL|0|0|$ .00
*CS78|STAN-CS-67-078*COLBY & ENEA,MACHINE UTIL "GOOD"|0|0|$ .00
*CS79|STAN-CS-67-079*DORAN,360 U.S. FORTRAN IV|0|0|$ .00
*CS80|STAN-CS-67-080*FRIEDMAN,DIRECTED RANDOM GENERATION|0|0|$ .00
*CS81|STAN-CS-67-081*GOLUB,WELSCH,GAUSS QUADRATURE RULES|5|0|$ 2.55
*CS82|STAN-CS-67-082*TESLER,ENEA,COLBY,DIGRAPH REPR BELIEF SYSTEMS|0|0|$ 2.65
*CS83|STAN-CS-68-083*BJORCK & GOLUB,ITERATIVE REFINEMENTS|0|0|$ .00
*CS84|STAN-CS-68-084*FRIEDMAN,SYSTEM FOR TRANSFORMATIONAL GRAMMAR|0|0|$ 2.65
*CS85|STAN-CS-68-085*COLBY,COMPUTER-AIDED LANG DEVEL|0|0|$ .00
*CS86|STAN-CS-68-086*BAUER ET AL.,ALGOL W|0|0|$ .00
*CS87|STAN-CS-68-087*EHRMAN,CS139 LECTURE NOTES|0|0|$ .00
*CS88|STAN-CS-68-088*SCHECHTER,RELAXATION METHODS|4|0|$ .00
*CS89|STAN-CS-68-089*BAUER ET AL.,ALGOL W (REV.)|0|0|$ .00
*CS90|STAN-CS-68-090*LESSER,MULTI-LEVEL COMPUTER|0|0|$ .00
*CS91|STAN-CS-68-091*WIRTH ET AL.,PL360 SYSTEM|0|0|$ .00
*CS92|STAN-CS-68-092*ENEA,MLISP|0|0|$ .00
*CS93|STAN-CS-68-93*FORSYTHE, CS & EDUCATION|0|0|$ .00
*CS94|STAN-CS-68-094*SHAW,FORMAL DESCR & PARSING OF PICTURES|0|0|$ 7.85
*SLACR84|SAME
*CS95|STAN-CS-68-095*FRIEDMAN & DORAN,FORMAL SYNTAX TRANS GRAM|0|0|$ .00
*CS96|STAN-CS-68-096*SMITH,INTERVAL ARITH DET EVAL AND TESTING CHEB SYST|3|0|$ 2.50
*CS97|STAN-CS-68-097*MILLER,RESEARCH CSD|0|0|$ .00
*CS98|STAN-CS-68-098*BAUER ET AL.,ALGOL W IMPLEMENTATION|0|0|$ .00
*CS99|STAN-CS-68-099*FRIEDMAN,LECTURE NOTES|0|0|$ .00
*CS100|STAN-CS-68-100*BREDT,MODEL OF INFORM. PROC. IN CHILDREN|0|0|$ 3.50
*CS101|STAN-CS-68-101*KAPLAN,FORMAL STRONG EQUIV FOR ELEMENTAL PGMS|0|300|$ 9.60
*CS102|STAN-CS-68-102*PNUELI,INTEGER PROGRAMMING OVER A CONE|4|0|$ 2.60
*CS103|STAN-CS-68-103*BREDT & FRIEDMAN,LEXICAL INSERTION|0|0|$ .00
*CS104|STAN-CS-68-104*BARTELS,NUMERICAL INVESTIGATION SIMPLEX METHOD|0|0|$ .00
*CS105|STAN-CS-68-105*RICHMAN, EPSILON CALCULUS|0|0|$ 5.85
*CS106|STAN-CS-68-106*HUBERMAN, PROGRAM TO PLAY CHESS END GAMES-THESIS|0|0|$ 9.60
*AIM65|SAME
*CS106|STAN-CS-68-106*HUBERMAN,PROGRAM TO PLAY CHESS END GAMES|0|0|$ .00
*CS107|STAN-CS-68-107*JENKINS,THREE-STAGE VARIABLE-SHIFT|3|0|$ .00
*CS108|STAN-CS-68-108*FRIEDMAN,COMPUTER EXPERIMENTS|0|0|$ .00
*CS109|STAN-CS-68-109*FRIEDMAN,COMPUTER SYSTEM WRITING TRANS GRAM|0|0|$ .00
*CS110|STAN-CS-68-110*BAUER ET AL.,ALGOL W (REVISED)|0|0|$ 4.80
*CS111|STAN-CS-68-111*FRIEDMAN & MARTNER,ANALYSIS TRANS GRAM|0|0|$ .00
*CS112|STAN-CS-68-112*FRIEDMAN & POLLACK,CONTROL LANG TRANS GRAM|0|0|$ .00
*CS113|STAN-CS-68-113*HANSEN,IMPACT STORAGE MANAGEMENT|0|0|$ .00
*CS114|STAN-CS-68-114*GEORGE,CALGEN-AN INTERACTIVE PICTURE|0|0|$ .00
*CS115|STAN-CS-68-115*FRIEDMAN ET AL,PROGRAMMER'S MANUAL|0|0|$ .00
*CS116|STAN-CS-68-116*PIEPER, KINEMATICS OF MANIP.UNDER COMP.CONTRL.|0|0|$ .00
*AIM72|SAME
*CS117|STAN-CS-68-117*ADAMS,COMP MODEL DATA-FLOW SEQUENCING|0|0|$ .00
*CS118|STAN-CS-68-118*WATERMAN, MACHINE LEARNING OF HEURISTICS-THESIS|0|0|$ .00
*AIM74|SAME
*CS119|STAN-CS-68-119*DANTZIG ET AL.,MATH PROG LANG|0|0|$ .00
*CS120|STAN-CS-68-120*SATTERTHWAITE,MUTANT 0.5:PROG LANG|0|0|$ .00
*CS121|STAN-CS-69-121*MOLER,EIGENVALUES OF LAPLACIAN,RHOMBICAL DOM|5|0|$ 2.20
*CS122|STAN-CS-69-122*MITCHELL & MCCRAITH,HEURISTIC ANALYSIS|4|0|$ 2.35
*CS123|STAN-CS-69-124*GOLUB,MATRIX DECOMPOSITIONS|0|0|$ .00
*CS124|STAN-CS-69-124*GOLUB,MATRIX DECOMPOSTIONS|0|0|$ .00
*CS125|STAN-CS-69-125*FELDMAN ET AL, GRAMTCL CMPLXTY & INFERENCE|12|0|$ 4.50
*AIM89|SAME
*CS126|STAN-CS-69-126*DANTZIG,COMPLEMENTARY SPANNING TREES|11|0|$ 2.00
*CS127|STAN-CS-69-127*VICENS, ASPTS OF SPEECH RECOGNTN BY COMPTR-THESIS|0|0|$ 8.00
*AIM85|SAME
*CS128|STAN-CS-69-128*BUZBEE ET AL.,ODD/EVEN REDUCTION|0|0|$ 2.90
*CS129|STAN-CS-69-129*MILLER, RESEARCH IN CSD|8|0|$ 4.15
*CS130|STAN-CS-69-130*SCHANK, REPR FOR COMPUTER-ORIENTED SEMANTICS(THESIS)|0|0|$ .00
*AIM83|SAME
*CS131|STAN-CS-69-131*SMITH,MAN-MACHINE INTERACTION(THESIS)|1|0|$ .00
*CS133|STAN-CS-69-133*GOLUB & REINSCH,HANDBOOK SERIES LINEAR ALGEBRA|0|0|$ 2.85
*CS134|STAN-CS-69-134*GOLUB & SAUNDERS,LINEAR LEAST SQUARES|0|0|$ .00
*CS135|STAN-CS-69-135*GRIES,COMPILER IMPLEMENTATION LANG|0|0|$ .00
*CS136|STAN-CS-69-136*POHL,BI-DIRECTIONAL AND HEURISTIC SEARCH|2|0|$ 6.40
*CS137|STAN-CS-69-137*HENRICI,FIXED POINTS ANALYTIC FUNCTIONS|7|0|$ 1.90
*CS138|STAN-CS-69-138*GREEN, APLCTN THERM PROVG TO QSTN-ANSRG SYS-THESIS|0|0|$ .00
*AIM96|SAME
*CS139|STAN-CS-69-139*HORNING, STUDY OF GRAMMATICAL INFRENCE-THESIS|32|0|$ 6.35
*AIM98|SAME
*CS140|STAN-CS-69-140*FORSYTHE,DESIGN-THEN & NOW|5|0|$ .00
*CS141|STAN-CS-69-141*DAHLQUIST ET AL., BOUNDS FOR ERROR|2|0|$ 2.50
*CS142|STAN-CS-69-142*GOLUB & UNDERWOOD,STATIONARY VALUES|1|0|$ 2.35
*CS143|STAN-CS-69-143*JENKINS,THREE-STAGE VARIABLE-SHIFT|0|0|$ .00
*CS144|STAN-CS-69-143*FORSYTHE,POSITIVE DEFINITE QUAD POLYNOMIAL|15|0|$ .00
*CS145|STAN-CS-69-145*HENRICI,SOLVING POLYNOMIAL EQUATIONS|11|0|$ 2.45
*CS146|STAN-CS-70-146*RAMOS,ROUNDOFF ERROR ANALYSIS|6|0|$ 2.50
*CS147|STAN-CS-70-147*FORSYTHE,PITFALLS IN COMPUTATION|0|0|$ .00
*CS148|STAN-CS-70-148*KNUTH & FLOYD,AVOIDING "GO TO" STATEMENTS|0|0|$ .00
*CS149|STAN-CS-70-149*KNUTH,OPTIMUM BINARY SEARCH TREES|0|0|$ .00
*CS150|STAN-CS-70-150*WILKINSON,ELEMENTARY PROOF|12|0|$ 2.50
*CS151|STAN-CS-70-151*VOLKOV(TRANS. FORSYTHE),SOLUTION LAPLACE'S EQUATION|9|0|$ 2.50
*CS152|STAN-CS-70-152*GUSTAFSON,RAPID COMPUTATION INTERPOLATION FORM|9|0|$ 2.40
*CS153|STAN-CS-70-153*GUSTAFSON,ERROR PROPAGATION|6|0|$ 2.20
*CS154|STAN-CS-70-154*STONE,INCORRECTLY DECODED BURSTS|6|0|$ 2.40
*CS155|STAN-CS-70-155*BUZBEE ET AL.,ODD/EVEN REDUCTION (2)|3|0|$ 2.80
*CS156|STAN-CS-70-156*DANTZIG,COMPUTING ROUNDOFF ERROR|5|0|$ 1.85
*CS157|STAN-CS-70-157*BRENT,ALGORITHMS MATRIX MULTIPLICATON|0|0|$ .00
*CS158|STAN-CS-70-158*STONE,PARALLEL PROCESSING|3|0|$ 2.80
*CS159|STAN-CS-70-159*GEORGE,SOLUTION DISCRETE POISSON EQUATION|0|0|$ 1.75
*CS160|STAN-CS-70-160*BREDT & MCCLUSKEY,PARALLEL COMPUTER SYSTEMS|0|0|$ .00
*CS161|STAN-CS-70-161*HOFFMAN,FORMULARY MODEL ACCESS CONTROL(THESIS)|2|0|$ 3.55
*CS162|STAN-CS-70-162*BARTELS ET AL.,NUMERICAL TECHNIQUES MATH PROG|0|0|$ 3.55
*CS163|STAN-CS-70-163*MALCOLM,ALGORITHM FOR FLOATING POINT|7|0|$ 2.35
*CS164|STAN-CS-70-164*KAUFMAN,ESTIMATES ROUNDOFF ERROR|14|0|$ 2.20
*CS165|STAN-CS-70-165*BAUER & STONE,N TASKS WITH M OPERATIONS|1|0|$ 2.70
*CS166|STAN-CS-70-166*SANDEWALL, RPRSNTG NATURAL-LNGUGE INFO PRDICT CALCULUS|0|0|$ .00
*AIM128|SAME
*CS167|STAN-CS-70-167*IGARASHI, SEMANTICS OF ALGOL-LICK STATEMENTS|0|0|$ 4.55
*AIM129|SAME
*CS168|STAN-CS-70-168*KELLY, VSUL I.D. OF PEOPLE BY COMPUTER-THESIS|0|0|$ 8.85
*AIM130|SAME
*CS169|STAN-CS-70-169*KNUTH,EXAMPLES OF FORMAL SEMANTICS|0|0|$ 2.70
*AIM126|SAME
*CS170|STAN-CS-70-170*BREDT,CONCURRENT SEQUENTIAL PROG|3|0|$ 3.20
*CS171|STAN-CS-70-171*BREDT,MODELS PARALLEL COMPUTING|0|0|$ .00
*CS172|STAN-CS-70-172*BREDT,ANALYSIS PARALLEL SYSTEMS(THESIS)|0|0|$ .00
*CS173|STAN-CS-70-173*BREDT,MUTUAL EXCLUSION PROBLEM|0|0|$ .00
*CS174|STAN-CS-70-174*MANNA, WALDINGER, TWRDS AUTO PROGRAM SYNTHESIS|67|0|$ 3.20
*AIM127|SAME
*CS175|STAN-CS-70-175*MALCOLM,EUCLIDEAN INNER PRODUCTS|10|0|$ 1.85
*CS176|STAN-CS-70-176*FEIGENBAUM ET AL ON GENERALITY & PROBLEM SOLVING|0|0|$ .00
*AIM131|SAME
*CS177|STAN-CS-70-178*FORSYTHE & MILLER, RESEARCH REVIEW|11|0|$ .00
*CS178|STAN-CS-70-178*FORSYTHE & MILLER,RESEACH REVIEW|4|0|$ .00
*CS179|STAN-CS-70-179*SMITH, MLISP|76|0|$ 4.50
*AIM135|SAME
*CS180|STAN-CS-70-180*FLAK,CMPTR INTPRT IMPRFT LINE DTA AS 3D SCNE-THESIS|0|0|$ 7.30
*AIM132|SAME
*CS181|STAN-CS-70-181*HEARN, REDUCE 2|0|0|$ .00
*AIM133|SAME
*CS182|STAN-CS-70-182*TENENBAUM, ACMDATN IN COMPUTER VISION-THESIS|0|0|$ .00
*AIM134|SAME
*CS183|STAN-CS-70-183*WHITE, MCHN LEARN THRU SGNTR TREES APPLY TO HUMAN SPEECH|0|0|$ .00
*AIM136|SAME
*CS184|STAN-CS-70-184*MALCOLM,NOTE ON CONJECTURE OF MORDELL|5|0|$ 1.85
*CS185|STAN-CS-70-185*NELSON,GRAPH PROGRAM SIMULATION|0|0|$ .00
*CS186|STAN-CS-70-186*KNUTH, AN EMPIRICAL STUDY OF FORTRAN IN USE|0|0|$ .00
*AIM137|SAME
*CS187|STAN-CS-70-187*DANTZIG ET AL.,MATH PROG LANG SPEC MANUAL|0|0|$ .00
*CS188|STAN-CS-71-188*ASHCROFT&MANNA,TRNSLAT OF GO-TO PRGM TO WHILE PRGM|0|0|$ 2.50
*AIM138|SAME
*CS189|STAN-CS-71-189*MANNA, MATH THEORY OF PARTIAL CORRECTNESS|121|0|$ 2.40
*AIM139|SAME
*CS190|STAN-CS-70-190*HOPCROFT,N LOG N ALGORITHM|0|0|$ .00
*CS191|STAN-CS-70-191*LESSER,INTRO TO DIRECT EMULATION|0|0|$ .00
*CS192|STAN-CS-70-192*HOPCROFT,N LOG N ALGORITHM|9|0|$ 1.90
*CS193|STAN-CS-71-193*SCHANK, INTENTION MEMORY & COMPUTER UNDERSTANDING|1|0|$ .00
*AIM140|SAME
*CS194|STAN-CS-70-194*KNUTH,ERRATA & ADDENDA|0|0|$ .00
*CS195|STAN-CS-70-195*BUZBEE ET AL.,DISCRETE POISSON EQUATION|7|0|$ 2.60
*CS196|STAN-CS-70-196*MOLER,MATRIX COMPUTATIONS|11|0|$ 2.10
*CS197|STAN-CS-71-197*KNUTH & SITES,MIX/360 USER'S GUIDE|10|0|$ 2.05
*CS198|STAN-CS-71-198*BRENT,ALGORITHMS FOR FINDING ZEROS|0|0|$ .00
*CS199|STAN-CS-71-199*STAFF,BIBLIOGRAPHY CSD REPORTS|0|0|$ .00
*CS200|STAN-CS-71-200*HERRIOT,ALGOL 60 PROCEDURES|0|0|$ .00
*CS201|STAN-CS-71-201*HOPCROFT & TARJAN*PLANARITY TESTING|1|0|$ 2.25
*CS202|STAN-CS-71-202*SAAL & RIDDLE,COMMUNICATING SEMAPHORES|1|0|$ .00
*CS203|STAN-CS-71-203*BUCHANAN ET AL, HRSTC DENDRAL PRGM FOR EXPLAIN EMPIRCL DTA|0|0|$ .00
*AIM141|SAME
*CS204|STAN-CS-71-204*INGALLS,FETE-FORTRAN TIME ESTIMATOR|0|0|$ .00
*CS205|STAN-CS-71-205*MILNER, ALGBRC DEFNTN SMULTN BTWN PRGMS|0|0|$ 2.30
*AIM142|SAME
*CS206|STAN-CS-71-206*KNUTH, MATH ANALYSIS ALGORITHMS|0|0|$ 2.25
*CS207|STAN-CS-71-207*HOPCROFT & TARJAN,EFFICIENT ALGORITHMS|2|0|$ .00
*CS208|STAN-CS-71-208*GEORGE,FINITE ELEMENT METHOD(THESIS)|0|0|$ .00
*CS209|STAN-CS-71-209*MCCARTHY ET AL, PROJECT TECH REPORT|1|0|$ 4.10
*AIM143|SAME
*CS210|STAN-CS-71-210*PURDY, ACCESS,PROG FOR CATALOG|3|0|$ 2.55
*CS211|STAN-CS-71-211*MALCOLM,ALGORITHM TO REVEAL PROPERTIES|6|0|$ .00
*CS212|STAN-CS-71-212*MORGANA,TIME & MEMORY REQUIREMENTS|11|0|$ 1.90
*CS213|STAN-CS-71-213*TARJAN,SWITCHYARD PROBLEM|33|0|$ 2.10
*CS214|STAN-CS-71-214*GRAHAM & KNUTH,COMPLEMENTS & TRANSITIVE CLOSURES|36|0|$ 1.90
*CS215|STAN-CS-71-215*MALCOLM,PL360|0|0|$ .00
*CS216|STAN-CS-71-216*KLING, RESNG ANGLY W/APPLY TO HRSTC PRBLM SLOVG-THESIS|0|0|$ .00
*AIM147|SAME
*CS217|STAN-CS-71-217*ASHCROFT ETAL,DCDBL PRPTS OF MONADIC FNTNL SCHEMAS|73|0|$ 2.00
*AIM148|SAME
*CS218|STAN-CS-71-218*DEBRUIJN ET AL.,AVERAGE HEIGHT PLANE TREES|8|0|$ 1.90
*CS219|STAN-CS-71-219*QUAM, COMPUTER COMPARISON OF PICTURES-THESIS|24|0|$ 5.05
*AIM144|SAME
*CS220|STAN-CS-71-220*STONE,DYNAMIC MEMORIES|5|0|$ 2.65
*CS221|STAN-CS-71-221*BUCHANAN ET AL, HRSTC PRGMG STDY OF THEORY FRMTN IN SCI|0|0|$ .00
*AIM145|SAME
*CS222|STAN-CS-71-222*MEYERS,LINEAR REP TREE STRUCTURE|1|14|$ .00
*CS223|STAN-CS-71-223*GRAHAM,PRECEDENCE LANGUAGES(THESIS)|0|0|$ .00
*CS224|STAN-CS-71-224*ERSHOV, PARALLEL PROGRAMMING|0|0|$ 2.10
*AIM146|SAME
*CS225|STAN-CS-71-225*BJORCK & GOLUB,NUMERICAL METHODS|0|0|$ .00
*CS226|STAN-CS-71-226*GEORGE,SIMPLE-PRECEDENCE TRANSLATOR|1|0|$ 4.45
*CS227|STAN-CS-71-227*GEORGE,GEMS-GRAPH EXPER META SYS(THESIS)|0|0|$ .00
*CS228|STAN-CS-71-228*KAUFMAN,FUNC MIN & AUTO THER CONTROL|4|0|$ 2.60
*CS229|STAN-CS-71-229*LEE & FORSYTHE,VARIA STUDY NONLINEAR SPLINE CURV|4|0|$ 2.35
*CS230|STAN-CS-71-230*SITES,ALGOL W REFERENCE MANUAL|0|0|$ .00
*CS232|STAN-CS-71-232*MOLER & STEWART,MATRIX EIGENVALUE PROBLEM|0|0|$ .00
*CS233|STAN-CS-71-233*WILNER,DECLARATIVE SEMANTIC DEFINITION(THESIS)|0|0|$ .00
*CS234|STAN-CS-71-234*GOLUB,MODIFIED EIGENVALUE PROBLEMS|0|0|$ .00
*CS236|STAN-CS-71-236*GOLUB & STYAN,NUMERICAL COMPUTATION|0|0|$ .00
*CS237|STAN-CS-71-237*VAN VOORHIS,DIVIDE-SORT-MERGE STRATEGY|0|0|$ .00
*CS238|STAN-CS-71-238*VAN VOORHIS,LOWER BOUND SORTING NETWORKS|0|0|$ .00
*CS239|STAN-CS-71-239*VAN VOORHIS,LARGE SORTING NETWORKS|0|0|$ .00
*CS240|STAN-CS-71-240*LONDON, CORRECTNESS OF 2 COMPILERS FOR LISP SUBSET|0|0|$ 2.95
*AIM151|SAME
*CS241|STAN-CS-71-241*BIERMANN, INFERENCE OF TURING MACH FRM SAMP COMPUTATIONS|0|0|$ .00
*AIM152|SAME
*CS242|STAN-CS-71-242*HAYES, FRAME PRBLM & RELATE PRBLM IN A.I.|0|0|$ 2.20
*AIM153|SAME
*CS243|STAN-CS-71-243*MANNA ET AL, INDCTV METHOD FOR PROVE PROPERTIES OF PRGMS|0|0|$ .00
*AIM154|SAME
*CS244|STAN-CS-71-244*TARJAN,PLANARITY ALGORITHM|0|0|$ .00
*CS245|STAN-CS-71-245*RYDER,HRSTC ANLS OF LRG TRES GNRAT GAME GO-THESIS|0|0|$ 10.10
*AIM155|SAME
*CS246|STAN-CS-71-246*COLBY ET AL, TEST VLD OF CMPTR SIMLAT PARNOD PRCES|104|0|$ 2.50
*AIM156|SAME
*CS247|STAN-CS-71-247*WILKS, ONE SMALL HEAD|0|0|$ .00
*AIM157|SAME
*CS248|STAN-CS-71-248*FREDMAN & KNUTH,RECURRENCE RELATIONS|0|0|$ 2.75
*CS249|STAN-CS-71-249*POLLACK,BIBLIO CONSTRUCT COMPILERS|0|0|$ .00
*CS250|STAN-CS-71-250*CHANDRA & MANNA, PROGRAM SCHEMAS WITH EQUALITY|19|0|$ 2.05
*AIM158|SAME
*CS251|STAN-CS-72-251*STONE, EFFICIENT PARALLEL ALGORITHM|0|0|$ .00
*CS252|STAN-CS-72-252*SAUNDERS,LARGE-SCALE LINEAR|0|0|$ .00
*CS253|STAN-CS-72-253*FELDMAN & SHIELDS, TTL CMPLX & INFRNCE OF BST PRGMS|12|0|$ 2.85
*AIM159|SAME
*CS254|STAN-CS-72-254*FORSYTHE,VON NEUMANN'S COMPARISON METHOD|2|0|$ 2.30
*CS255|STAN-CS-72-255*FELDMAN, AUTOMATIC PROGRAMMING|0|0|$ .00
*AIM160|SAME
*CS256|STAN-CS-72-256*CHVATAL,EDMONDS POLYHEDRA|3|0|$ 2.35
*CS257|STAN-CS-72-257*WIRTH,PASCAL,CODE GENERATION,CDC 6000|0|0|$ .00
*CS258|STAN-CS-72-258*BROWN,BASIC MACHINE ALGORITHMS|9|0|$ 2.15
*CS259|STAN-CS-72-259*CRANE,LINEAR LISTS (THESIS)|0|0|$ .00
*CS260|STAN-CS-72-260*PRATT,SHELLSORT & SORTING NETWORKS(THESIS)|0|0|$ .00
*CS261|STAN-CS-71-261*GOLUB & PEREYRA,DIFFERENTIATION PSEUDO-INVERSES|0|0|$ .00
*CS262|STAN-CS-72-262*STAFF,BIBLIOGRAPHY|1|0|$ .00
*CS263|STAN-CS-72-263*KLARNER & RIVEST,PROCEDURE UPPER BOUND|0|0|$ .00
*CS264|STAN-CS-72-264*WILKS, A.I. APPROACH TO MACHINE TRANSLATION|0|0|$ .00
*AIM161|SAME
*CS265|STAN-CS-72-265*SCHANK ET AL, PRIMTIV CNCEPTS UNDERLYING VERBS OF THOUGHT|0|0|$ .00
*AIM162|SAME
*CS266|STAN-CS-72-266*CADIOU, RCRSV DFNTNS PRTAL FNCTS & THER CMPTS-THESIS|0|0|$ 6.20
*AIM163|SAME
*CS267|STAN-CS-72-267*BONZON,MPL|3|0|$ 2.50
*CS268|STAN-CS-72-268*CHVATAL,DEGREES & MATCHING|1|0|$ 2.20
*CS269|STAN-CS-72-269*KLARNER & RADO,ARITHMETIC PROPERTIES|0|0|$ .00
*CS270|STAN-CS-72-270|0|0|$ .00
*CS271|STAN-CS-72-271*RIDDLE,SUPERVISORY SYSTEMS(THESIS)|0|0|$ .00
*CS272|STAN-CS-72-272*MANNA,VUILLEMIN, FXPT APRCH TO THEORY OF CMPUTN|9|0|$ 2.50
*AIM164|SAME
*CS273|STAN-CS-72-273*CHVATAL & SICHLER,CHROMATIC AUTOMORPHISMS|7|0|$ 2.05
*CS274|STAN-CS-72-274*KLARNER & RADO,LINEAR COMBINATIONS|10|0|$ 2.05
*CS275|STAN-CS-72-275*KLARNER,SETS GENERATED ITERATION |5|0|$ 2.20
*CS276|STAN-CS-72-276*KAUFMAN,ALGORITHM TO SOLVE AX=BX|0|0|$ .00
*CS277|STAN-CS-72-277*ZAHN,REGION BOUNDARIES|1|0|$ 2.90
*CS278|STAN-CS-72-278*CONCUS & GOLUB,SOLUTION NON-SEPARABLE EQUATIONS|0|0|$ 2.60
*CS279|STAN-CS-72-279*OSBORNE,TOPICS IN OPTIMIZATION|0|0|$ .00
*CS280|STAN-CS-72-280*BOCHVAR, 2 PAPERS ON PARTIAL PREDICATE CALCULUS|13|0|$ 3.20
*AIM165|SAME
*CS281|STAN-CS-72-281*QUAM ET AL, CMPTR INTRACTV PICT PRCSG|37|0|$ 2.85
*AIM166|SAME
*CS282|STAN-CS-72-282*CHANDRA, EFFICIENT COMPILATION OF LNR RCRSV PRGRMS|20|0|$ 2.90
*AIM167|SAME
*CS283|STAN-CS-72-283*STOUTMEYER,NUMERICAL IMPLEMENTATION(THESIS)|0|0|$ 5.65
*CS284|STAN-CS-72-284*CHVATAL,EDMONDS POLYHEDRA|54|0|$ 3.20
*CS285|STAN-CS-72-285*FLOYD & SMITH,LINEAR TIME TWO TAPE MERGE|11|0|$ 2.20
*CS286|STAN-CS-72-286*CHANDRA,MOSER'S PROBLEM IN 4 DIMENSIONS|5|0|$ 2.70
*CS287|STAN-CS-72-287*IGARASHI, ADMSBLY FXDPT INDCT 1ST-ODR LGC TYPD THRY|36|0|$ 2.85
*AIM168|SAME
*CS288|STAN-CS-72-288*MILNER, LOGIC FOR COMPUTABLE FUNCTIONS|0|0|$ .00
*AIM169|SAME
*CS289|STAN-CS-72-289*WILKS, LAKOFF ON LINGUISTICS & NATURAL LOGIC|0|0|$ .00
*AIM170|SAME
*CS290|STAN-CS-72-290*SCHANK, ADVERBS & BELIEF|0|0|$ .00
*AIM171|SAME
*CS291|STAN-CS-72-291*KNUTH,COMBINATORIAL LEMMAS|5|0|$ 2.35
*CS292|STAN-CS-72-292*CHVATAL ET AL,SELECTED COMBINATORIAL RESEARCH PROBLEMS|0|0|$ .00
*CS293|STAN-CS-72-293*LUKES,COMBINATORIAL SOLUTIONS(THESIS)|0|0|$ .00
*CS294|STAN-CS-72-294*SAAL & SHUSTEK,MICROPROGRAMMED IMPLEMENTATION|2|0|$ 2.30
*CS295|STAN-CS-72-295*PAIGE,BIDIAGONALIZATION OF MATRICES|0|0|$ .00
*CS296|STAN-CS-72-296*FREDMAN,RECURSIVELY DEFINED FUNCTIONS(THESIS)|1|0|$ 4.25
*CS297|STAN-CS-72-297*PAIGE,SOLVING MATRIX EQUATIONS|0|0|$ .00
*CS298|STAN-CS-72-298*KOGGE & STONE,PARALLEL ALGORITHM|0|0|$ .00
*CS299|STAN-CS-72-299*RUSSELL, SMTC CATS NMNLS CNCPTL DEPEND ANALS NAT LANG|0|0|$ .00
*AIM172|SAME
*CS300|STAN-CS-72-300*KAUFMAN,COUNTEREXAMPLE TO CONJECTURE|16|0|$ 1.85
*CS301|STAN-CS-72-301*SAUNDERS,CHOLESKY FACTORIZATION|0|0|$ .00
*CS302|STAN-CS-72-302*GOLUB,USES OF LANCZOS ALGORITHM|0|0|$ .00
*CS303|STAN-CS-72-303*MORRIS, CRTNS OF TRNSLTNS OF PROGRMG LANG-THESIS|0|0|$ .00
*AIM174|SAME
*CS304|STAN-CS-72-304*ANDERSSEN & GOLUB,RICHARDSON'S ITERATIVE PROCEDURE|0|0|$ .00
*CS305|STAN-CS-72-305*AGIN, RPRSNT & DESCRIP OF CRVD OBJECTS-THESIS|0|0|$ .00
*AIM173|SAME
*CS306|STAN-CS-72-306*POLLACK,BIBLIO COMPUTER GRAPHICS|0|0|$ .00
*CS307|STAN-CS-72-307*TANAKA, HADAMARD TRNSFRM SPEECH WAVE ANLS|55|0|$ 2.65
*AIM175|SAME
*CS308|STAN-CS-72-308*FELDMAN ET AL, RECENT DEVELOPMNTS IN SAIL|0|0|$ .00
*AIM176|SAME
*CS309|STAN-CS-72-309*LESSER,DYNAMIC CONTROL STRUCTURES|16|0|$ .00
*CS310|STAN-CS-72-310*KAUFMAN,SCHEDULING UNIT-TIME TASKS|0|0|$ .00
*CS311|STAN-CS-72-311*PAUL, MDLG TRJCT CALCUL & SERVOG A CMPTR CNTRLD ARM-THESIS|0|0|$ .00
*AIM177|SAME
*CS312|STAN-CS-72-312*GILL, VSL FDBC & RLTD PRBLM CMTR CTRLD HND EYE CORD-THESIS|0|0|$ .00
*AIM178|SAME
*CS313|STAN-CS-72-313*STAFF,BIBLIOGRAPHY|0|0|$ .00
*CS314|STAN-CS-72-314*KOGGE,PARALLEL ALGORITHMS(THESIS,PART 1)|0|0|$ .00
*CS315|STAN-CS-72-315*KOGGE,NUMERICAL STABILITY(THESIS,PART 2)|0|0|$ .00
*CS316|STAN-CS-72-316*KOGGE,MINIMAL PARALELLISM(THESIS,PART 3)|0|0|$ .00
*CS317|STAN-CS-72-317*BASKETT & FULLER,DRUM STORAGE UNITS|0|0|$ .00
*CS318|STAN-CS-72-318*BROWN ET AL.,CONSTRUCTIVE GRAPH LABELING|0|0|$ .00
*CS319|STAN-CS-72-319*GOLUB & VARAH,BEST L(2) SCALING OF MATRIX|0|0|$ .00
*CS320|STAN-CS-72-320*BAUMGART, WINGED EDGE POLYHEDRON REPRESENTATION|0|0|$ .00
*AIM179|SAME
*CS321|STAN-CS-72-321*BAJCSY, CMPTR I.D. OF TXTRD VISUAL SCENES-THESIS|1|0|$ .00
*AIM180|SAME
*CS322|STAN-CS-72-322*GILL ET AL.,MODIFYING MATRIX FACTORIZATIONS|0|0|$ .00
*CS323|STAN-CS-72-323*MALCOLM & PALMER,TRI-DIAGONAL LINEAR SYSTEMS|0|0|$ .00
*CS324|STAN-CS-72-324*BAUER, M X N SEQUENCING PROBLEM(THESIS)|0|0|$ .00
*CS325|STAN-CS-72-325*BUCHANAN, RVU HUBERT DREYFUS' WT CMPTRS CNT DO|0|0|$ .00
*AIM181|SAME
*CS326|STAN-CS-72-326*COLBY & HILF, TRNSCPT SMULTN PARANOID PROCS|1|0|$ .00
*AIM182|SAME
*CS327|STAN-CS-72-327*KLARNER & RIVEST,ASYMPTOTIC BOUNDS|0|0|$ .00
*CS328|STAN-CS-72-328*GABOW,EDMOND'S MAX MATCHING ALGORITHM|0|0|$ .00
*CS329|STAN-CS-72-329*FANG,FOLDS(THESIS)|0|0|$ .00
*CS330|STAN-CS-73-330*NEWEY, AXIOMS & THRY INTGRS LSTS & FINIT SETS LCF|0|0|$ 3.30
*AIM184|SAME
*CS331|STAN-CS-73-331*COLLINS, COMPUTING TIME OF THE EUCLIDEAN ALGORITHM|0|0|$ .00
*AIM187|SAME
*CS332|STAN-CS-73-332*MILNER, MODELS OF LCF|0|0|$ .00
*AIM186|SAME
*CS333|STAN-CS-73-333*CHANDRA & MANNA, ON THE POWER OF PROGRAMMING FEATURES|0|0|$ .00
*AIM185|SAME
*CS334|STAN-CS-73-334*MALCOLM & MOLER,URAND|0|0|$ .00
*CS335|STAN-CS-73-335*GOLUB & SENETA,INFINITE MARKOV MATRIX|13|0|$ 2.05
*CS336|STAN-CS-73-336*CHANDRA, PROPERTIES & APPLICTNS OF PRGRM SCHEMAS-THESIS|0|0|$ .00
*AIM188|SAME
*CS337|STAN-CS-73-337*GIPS & STINY, AESTHETICS SYSTEMS|0|0|$ .00
*AIM189|SAME
*CS338|STAN-CS-73-338*KLARNER,FINITE BASIS THEOREM REVISITED|0|0|$ .00
*CS339|STAN-CS-73-339*GOLUB & DENT,MAXIMUM LIKELIHOOD ESTIMATOR|0|0|$ .00
*CS340|STAN-CS-73-340*NEWEY, NTS ON PRBLM INVOLVG PRMUTNS AS SQUNCES|12|0|$ 2.25
*AIM190|SAME
*CS341|STAN-CS-73-341*KATZ & MANNA, HEURISTIC APPROACH TO PRGRM VERIFY|4|0|$ 2.85
*AIM191|SAME
*CS342|STAN-CS-73-342*KNUTH,MATROID PARTITIONING|0|0|$ .00
*CS343|STAN-CS-73-343*LEVINE,GERMAN GRAMMAR INSTRUCTION(THESIS)|9|0|$ 8.30
*CS344|STAN-CS-73-344*SCHANK, 14 PRIMITIVE ACTIONS & THEIR INFERENCES|0|0|$ .00
*AIM183|SAME
*CS345|STAN-CS-73-345*COLLINS & HOROWITZ, MIN ROOT SEPART OF A PLYNMAL|114|0|$ 2.05
*AIM192|SAME
*CS346|STAN-CS-73-346*COLBY, CMPTR TRTMT LANG DFICLT NSPEKG AUTISTIC CHLD|0|0|$ 2.10
*AIM193|SAME
*CS347|STAN-CS-73-347*COLBY & HILF, ANALYSIS SIMULAT PARANOID THOUGHT|116|0|$ 2.00
*AIM194|SAME
*CS348|STAN-CS-73-348*PEREYA,HIGH ORDER FINITE DIFFERENCE|0|0|$ .00
*CS349|STAN-CS-73-349*BLUM ET AL.,TIME BOUNDS FOR SELECTION|0|0|$ .00
*CS350|STAN-CS-73-350*KAUFMAN,ASSEMBLY LINE SCHEDULING PROBLEM|1|0|$ 2.35
*CS351|STAN-CS-73-351*FULLER,I/O CHANNEL MULT PAGING DRUMS(THESIS)|0|0|$ .00
*CS352|STAN-CS-73-352*FULLER,DIFF SLTF & MTPT DRUM(THESIS)|7|0|$ 1.90
*CS353|STAN-CS-73-353*FULLER,MTPT DISC SCHEDULING(THESIS)|5|0|$ 1.90
*CS354|STAN-CS-74-354*KLARNER,SDR'S REGULAR SYSTEMS|14|0|$ 1.90
*CS355|STAN-CS-73-355*PRICE,CENTRAL PROCESSOR SCHEDULING|0|0|$ .00
*CS356|STAN-CS-73-356*SMITH & ENEA, MLISP2|0|0|$ 4.25
*AIM195|SAME
*CS357|STAN-CS-73-357*GOLDMAN & RIESBECK, CNCPTULY BASED SENTENCE PRAPHRSR|0|0|$ .00
*AIM196|SAME
*CS358|STAN-CS-73-358*SCHANK & RIEGER, INFRNCE & CMPTR UDRSTNDG NAT LANG|0|0|$ .00
*AIM197|SAME
*CS359|STAN-CS-73-359*STONE,COMBINATORIAL PROBLEM|1|0|$ 1.90
*CS360|STAN-CS-73-360*MUNTZ & BASKETT,OPEN, CLOSED & MIXED NETWORKS|1|0|$ 2.90
*CS361|STAN-CS-73-361*BROWN & MASINTER,ALGORITHM ORGANIC MOLECULES|2|0|$ 2.45
*CS362|STAN-CS-73-362*PRINTED AS STAN-CS-73-398|0|0|$ .00
*CS363|STAN-CS-73-363*KAUFMAN,LZ ALGORITHM(THESIS)|0|0|$ .00
*CS364|STAN-CS-73-364*THOSAR, ESTMA DNSTY USE SIG TABL APPLY PAT RECOG|68|0|$ 2.75
*AIM198|SAME
*CS365|STAN-CS-73-365*IGARASHI ET AL, AUTOMATIC PROGRAM VERIFICATION I|0|289|$ .00
*AIM200|SAME
*CS366|STAN-CS-73-366*GRAPE, MODEL BASED COMPUTER VISION-THESIS|0|0|$ .00
*AIM201|SAME
*CS367|STAN-CS-73-367*AMBLE & KNUTH,ORDERED HASH TABLES|0|0|$ .00
*CS368|STAN-CS-73-368*SCHANK & WILKS, GOALS OF LINGUISTIC THEORY REVISITED|0|0|$ .00
*AIM202|SAME
*CS369|STAN-CS-73-369*SCHANK, DEVELOPMENT OF CONCEPTUAL STRUCTURES IN CHILD|0|0|$ .00
*AIM203|SAME
*CS370|STAN-CS-73-370*SRIDHARAN ET AL, HRSTC PRGRM FOR CMPLX ORGNC MLCULS|0|0|$ .00
*AIM205|SAME
*CS371|STAN-CS-73-371*KNUTH,REVIEW "STRUCTURED PROG"|31|0|$ 2.45
*CS372|STAN-CS-73-372*MALCOLM,NONLINEAR SPLINE FUNCTIONS(THESIS EXC.)|0|0|$ .00
*CS373|STAN-CS-73-373*VANLEHN, SAIL USERS MANUAL|0|0|$ 5.10
*AIM204|SAME
*CS374|STAN-CS-73-374*MALCOLM,FLOATING-POINT SUMMATION(THESIS EXC.)|0|0|$ .00
*CS375|STAN-CS-73-375*FISCHER ET AL.,FOURIER-TOEPLITZ METHODS|0|0|$ .00
*CS376|STAN-CS-73-376*MEINARDUS & TAYLOR,BEST UNIFORM APPROXIMATION|22|0|$ 2.30
*CS377|STAN-CS-73-377*WILKS, PREFERENCE SEMANTICS|46|0|$ 2.25
*AIM206|SAME
*CS378|STAN-CS-73-378*MOORER, OPTIMUM-COMB METHOD PITCH ANALYSIS|127|0|$ 2.40
*AIM207|SAME
*CS379|STAN-CS-73-379*MOORER, HETERODYNE METHOD ANALYSIS WAVEFORMS|124|0|$ 2.40
*AIM208|SAME
*CS380|STAN-CS-73-380*YAKIMOVSKY, SCNE ANAL USE SEMNTC BASE RGN GROW-THESIS|0|0|$ .00
*AIM209|SAME
*CS381|STAN-CS-73-381*SRIDHARAN,COMP GENERATION VERTEX-GRAPHS|3|0|$ 2.20
*CS382|STAN-CS-73-382*MANNA & PNUELI, AXMTC APRCH TO CORRECT PRGRM|55|0|$ 2.40
*AIM210|SAME
*CS383|STAN-CS-73-383*WILKS, NATURAL LANGUAGE INFERENCE|0|0|$ .00
*AIM211|SAME
*CS384|STAN-CS-73-384*HERSKOVITS, GNRTN OF FRENCH FRM SEMANTIC REPSENT|0|0|$ .00
*AIM212|SAME
*CS385|STAN-CS-73-385*THOSAR, RECOGNITION OF CONTINUOUS SPEECH|56|0|$ 2.75
*AIM213|SAME
*CS386|STAN-CS-73-386*PERKINS & BINFORD, CRNR FNDR FOR VSAL FDBK|2|0|$ 3.35
*AIM214|SAME
*CS387|STAN-CS-73-387*BUCHANAN & SRIDHARAN, ANLS OF BEHAV OF CHEM MOLCLS|0|0|$ 2.15
*AIM215|SAME
*CS388|STAN-CS-73-388*SWANSON,UNSCRAMBLE (P)-ORDERED VECTORS|2|0|$ 3.40
*CS389|STAN-CS-73-389*MASINTER ET AL, APPLY OF A.I. FOR CHEM INFERENCE|0|0|$ .00
*AIM216|SAME
*CS390|STAN-CS-73-390*GIPS,INVERSE TURING MACHINE|2|0|$ 1.90
*CS391|STAN-CS-73-391*SRIDHARAN, SRCH STRTGES TSK ORGNC CHEM SYNTHESIS|0|0|$ .00
*AIM217|SAME
*CS392|STAN-CS-73-392*KNUTH,SORTING & SEARCHING-ERR. & ADD.|66|0|$ 2.60
*CS393|STAN-CS-73-393*VUILLEMIN, PROOF TECHNIQUES FOR RECURSIVE PRGRM-THESIS|0|0|$ .00
*AIM218|SAME
*CS394|STAN-CS-73-394*HOARE, PARALLEL PROGRAMMING|0|0|$ .00
*AIM219|SAME
*CS395|STAN-CS-73-395*STAFF,BIBLIOGRAPHY|0|0|$ .00
*CS396|STAN-CS-73-396*BOLLES & PAUL,THE USE OF SENSORY FEEDBACK...SYSTEMS|33|0|$ 2.45
*AIM220|SAME
*CS397|STAN-CS-73-397*HENRICI,COMPUTATIONAL ANALYSIS|0|0|$ .00
*CS398|STAN-CS-73-398*BAUMGART, IMAGE CONTOURING & COMPARING|29|0|$ 3.15
*AIM199|SAME
*CS399|STAN-CS-73-399*PAIGE & SAUNDERS,SOLUTION SPARSE INDEF SYSTEMS|0|0|$ .00
*CS400|STAN-CS-73-400*HOARE, RECURSIVE DATA STRUCTURES|0|0|$ 2.70
*AIM223|SAME
*CS401|STAN-CS-74-401*HOARE,MONITORS:STRUCTURING CONCEPT|0|0|$ .00
*CS402|STAN-CS-74-402*HERRIOT & REINSCH,QUINTIC SPLINE FUNCTIONS|0|0|$ .00
*CS403|STAN-CS-73-403*HOARE, HINTS ON PROGRAMMING LANGUAGE DESIGN|0|244|$ .00
*AIM224|SAME
*CS404|STAN-CS-74-404*SRIDHARAN,QUADRI/TRIVALENT GRAPHS|1|0|$ .00
*CS405|STAN-CS-76-405*DAVIS & WRIGHT,STANFORD CSD RESEARCH REPORT|0|0|$ .00
*CS406|STAN-CS-74-406*PERKINS, MOMORY MODEL FOR A ROBOT|0|294|$ .00
*AIM225|SAME
*CS407|STAN-CS-74-407*WRIGHT & GORIN, FAIL|0|124|$ 3.40
*AIM226|SAME
*CS408|STAN-CS-74-408*THOMAS & BINFORD, INFO PRCSG ANALS VSUL PRECPT|0|249|$ 3.10
*AIM227|SAME
*CS409|STAN-CS-73-409*EARNEST, FINAL RPT:1ST 10YRS AI RSRCH AT STANFORD|0|246|$ 5.25
*AIM228|SAME
*CS410|STAN-CS-74-410*PETERSON,MODELLING PARALLEL SYSTEMS(THESIS)|0|0|$ 3.10
*CS411|STAN-CS-74-411*ANDERSON ET AL, AFTER LEIBNIZ...|0|246|$ 3.00
*AIM229|SAME
*CS412|STAN-CS-74-412*SWINEHART, COPILOT-THESIS|0|248|$ .00
*AIM230|SAME
*CS413|STAN-CS-74-413*GIPS, SHAPE GRAMMARS & THEIR USES|0|250|$ .00
*AIM231|SAME
*CS414|STAN-CS-74-414*BAUMGART, GEOMED-GEOMETRIC EDITOR|0|247|$ .00
*AIM232|SAME
*CS415|STAN-CS-74-415*RIVEST,ASSOCIATIVE RETRIEVAL ALGORITHMS|0|0|$ .00
*CS416|STAN-CS-74-416*KNUTH,STRUCTURED PROGRAMMING "GO TO"|0|0|$ .00
*CS417|STAN-CS-74-417*SITES,PROVING CLEAN TERMINATION|0|0|$ .00
*CS418|STAN-CS-74-418*SITES,PROVING COMPUTER PROGRAMS TERMINATE CLEANLY|0|0|$ .00
*CS419|STAN-CS-74-419*RIEGER,CONCEPTUAL MEMORY-THESIS|0|244|$ .00
*AIM233|SAME
*CS420|STAN-CS-74-420*WAKERLY,PARTIALLY SELF-CHECKING CIRCUITS|0|0|$ .00
*CS421|STAN-CS-74-421*WAKERLY,LOW-COST ERROR DETECTION(THESIS)|0|0|$ .00
*CS422|STAN-CS-74-422*STONE,PARALLEL TRIDIAG EQUATION SOLVERS|0|0|$ .00
*CS423|STAN-CS-74-423*RAO,ASYMPTOTIC REPRESENTATION|0|0|$ .00
*CS424|STAN-CS-74-424*SCHLUMBERGER,LOGARITHMIC COMMUN (THESIS,PT 1)|0|0|$ .00
*CS425|STAN-CS-74-425*SCHLUMBERGER,DEBRUIJN COMM NETS(THESIS,PT 2)|0|0|$ .00
*CS426|STAN-CS-74-426*SCHLUMBERGER,QUEUING MESSAGES(THESIS,PT 3)|0|0|$ .00
*CS427|STAN-CS-74-427*LANG,PERFECT SHUFFLE ARRAY COMP(THESIS EXC)|0|0|$ .00
*CS428|STAN-CS-74-428*LANG,SHUFFLE-EXCHANGE NETWORK(THESIS EXC)|0|0|$ .00
*CS429|STAN-CS-74-429*ORCUTT,DATA ROUTING SCHEMES(THESIS EXC)|0|0|$ .00
*CS430|STAN-CS-74-430*ORCUTT,COMPUTER ARCHITECTURE(THESIS EXC)|0|0|$ .00
*CS431|STAN-CS-74-431*COLBY ET AL, PTRN-MTCHG RULE FOR RECOG NAT LANG EXPR|0|242|$ .00
*AIM234|SAME
*CS432|STAN-CS-74-432*WEYHRAUCH & THOMAS, FOL: PRF CHK 1ST ORDR LGC|66|275|$ 3.30
*AIM235|SAME
*CS433|STAN-CS-74-433*BUCHANAN & LUCKHAM, AUTOING CNSTRCTN OF PRGRMS|0|273|$ .00
*AIM236|SAME
*CS434|STAN-CS-74-434*RUHE & WEDIN,SEPARABLE NONLINEAR LEAST SQUARES|11|0|$ .00
*CS435|STAN-CS-74-435*PRICE,BALANCED COMPUTER SYSTEMS|0|0|$ .00
*CS436|STAN-CS-74-436*WILKS,NATURAL LANGUAGE UNDERSTANDING SYSTEMS..PARADIGM|0|271|$ 2.85
*AIM237|SAME
*CS437|STAN-CS-74-437*RIESBECK, COMPUTATIONAL UNDERSTANDING-THESIS|0|271|$ 9.05
*AIM238|SAME
*CS438|STAN-CS-74-438*HANNAH, CMPTR MTCHG OF AREAS IN STERO IMGS-THESIS|0|285|$ 4.70
*AIM239|SAME
*CS439|STAN-CS-74-439*COTTLE ET AL.,LINEAR COMPLEMENTARITY PROBS|0|0|$ .00
*CS440|STAN-CS-74-440*MORRIS ET AL,FAST PATTERN MATCHING|0|0|$ .00
*CS441|STAN-CS-441*KNUTH & MOORE,ALPHA-BETA PRUNING|0|0|$ .00
*CS442|STAN-CS-74-442*KNUTH, ESTIMATING EFFICIENCY|0|0|$ .00
*CS443|STAN-CS-74-443*BROTZ,HEURISTIC PROB SOLVING METHODS(THESIS)|0|132|$ .00
*CS444|STAN-CS-74-444*GREEN ET AL, PRGRS RPT ON PRGRM-UNDRSTNDG SYS|0|279|$ 3.10
*AIM240|SAME
*CS445|STAN-CS-74-445*FRIEDMAN ET AL.,FINDING NEAREST NEIGHBORS|0|0|$ .00
*CS446|STAN-CS-74-446*AIELLO & WEYHRAUCH, LCFSMALL|35|297|$ 2.95
*AIM241|SAME
*CS447|STAN-CS-74-447*AIELLO ET AL, SEMANTICS OF PASCAL IN LCF|0|295|$ .00
*AIM221|SAME
*CS448|STAN-CS-74-448*GOLDFARB,MATRIX FACTORIZATION|55|0|$ .00
*CS449|STAN-CS-74-449*SMITH,PERFORMANCE ANALYSIS(THESIS)|0|0|$ .00
*CS450|STAN-CS-74-450*BASKETT & SMITH,MULTIPROCESSOR COMP SYS (THESIS EXC)|0|0|$ .00
*CS451|STAN-CS-74-451*SMITH,SET PAGING ALGORITHM(THESIS EXC)|0|0|$ .00
*CS452|STAN-CS-74-452*LOW, AUTOMATIC CODING-THESIS|0|289|$ .00
*AIM242|SAME
*CS453|STAN-CS-74-453*KNUTH,RANDOM MATROIDS|41|0|$ 2.60
*CS454|STAN-CS-74-454*JENNINGS,SIMULTANEOUS ESTIMATION|22|0|$ 2.15
*CS455|STAN-CS-74-455*TARJAN,EDGE-DISJOINT SPANNING TREES|4|0|$ 2.90
*CS456|STAN-CS-74-456*FINKEL ET AL, AL-PRGRMG SYS FOR AUTO|243|289|$ .00
*AIM243|SAME
*CS457|STAN-CS-74-457*COLBY, 10 CRITICISMS OF PARRY|0|249|$ 1.90
*AIM244|SAME
*CS458|STAN-CS-74-458*BUCHANAN, STUDY IN AUTOMATIC PROGRAMMING-THESIS|0|283|$ .00
*AIM245|SAME
*CS459|STAN-CS-74-459*WINOGRAD, 5 LECTURES ON A.I.|0|251|$ 2.60
*AIM246|SAME
*CS460|STAN-CS-74-460*PORTER & SIMON, RANDOM INSERTION|64|0|$ 2.45
*CS461|STAN-CS-74-461*GOLDMAN, CPTR GENR NAT LANG DEP CNCPT BAS-THESIS|0|286|$ 11.25
*AIM247|SAME
*CS462|STAN-CS-75-462*PINGLE & THOMAS, FST FETUR-DRVN STERO DPTH PRGRM|49|297|$ 2.15
*AIM248|SAME
*CS463|STAN-CS-74-463*BAUMGART, GEOMTRC MDLG FOR CMPTR VSN-THESIS|0|248|$ 5.65
*AIM249|SAME
*CS464|STAN-CS-74-464*DSCRPT CMPLX CRVD OBJTS RECOG & VSUL MMRY-THESIS|0|292|$ 5.50
*AIM250|SAME
*CS465|STAN-CS-74-465*SHORTLIFFE, MYCIN-THESIS|0|282|$ .00
*AIM251|SAME
*CS466|STAN-CS-74-466*EARNEST, RSRCH IN AI, HRSTC PRGRMG & NTWRK PRTCL|0|249|$ 3.80
*AIM252|SAME
*CS467|STAN-CS-74-467*AIELLO,WEYHRAUCH, CHK PRFS METAMATH 1STORDR LGC|86|297|$ 3.25
*AIM222|SAME
*CS468|STAN-CS-74-468*KROGDAHL,COMBINATORIAL BASE|32|0|$ 2.45
*CS469|STAN-CS-74-469*BROWN,MOLECULAR STRUCTURE ELUCIDATION|28|0|$ 2.80
*CS470|STAN-CS-74-470*TRABB PARDO,STABLE SORTING & MERGING|0|0|$ .00
*CS471|STAN-CS-74-471*FAUGHT ET AL, AFTS & INTNTNS IN MDL OF PARANOIA|83|298|$ 2.75
*AIM253|SAME
*CS472|STAN-CS-74-472*QUAM & HANNAH, STANFORD AUTO PHOTOGRMETRY RSRCH|59|298|$ 2.15
*AIM254|SAME
*CS473|STAN-CS-74-473*SUZUKI, AUTOMATIC PROGRAM VERIFICATION II|0|248|$ 2.50
*AIM255|SAME
*CS474|STAN-CS-74-474*V.HENKE & LUCKHAM, AUTO PROGRAM VERIFICATION III|0|291|$ .00
*AIM256|SAME
*CS475|STAN-CS-75-475*NEWEY, FRML SMNTS LISP W/APLY TO PRGRM CRT-THESIS|0|294|$ 7.25
*AIM257|SAME
*CS476|STAN-CS-75-476*GREEN & BARSTOW, HYPTCL DIAL FOR PRGRM-UDRSTDG SYS|0|292|$ .00
*AIM258|SAME
*CS477|STAN-CS-75-477*CHVATAL & SANKOFF,TWO RANDOM SEQUENCES|12|0|$ 2.20
*CS478|STAN-CS-75-478*GOLUB & WILKINSON,ILL-CONDITIONED EIGENSYSTEMS|0|0|$ .00
*CS479|STAN-CS-75-479*CHATELIN & LEMORDANT,ERROR BOUNDS IN EIGENVALUES|2|0|$ 2.40
*CS480|STAN-CS-75-480*KNUTH,GENERALIZED DEDEKIND SUMS|0|0|$ .00
*CS481|STAN-CS-75-481*OLIGER,INITIAL-BOUNDARY VALUE PROBLEM|28|0|$ .00
*CS482|STAN-CS-75-482*FRIEDMAN ET AL,ALGORITHM FOR FINDING BEST MATCHES|0|0|$ .00
*CS483|STAN-CS-75-483*ERDOS & GRAHAM,PACKING SQUARES WITH EQUAL SQUARES|12|0|$ 1.90
*CS484|STAN-CS-75-484*GRAHAM & SZEMEREDI,SUBGRAPH NUMBER INDEPENDENCE|9|0|$ 2.20
*CS485|STAN-CS-75-485*ERDOS & SZEMEREDI,MULTIPLICATIVE REPRESENTATIONS|36|0|$ 2.20
*CS486|STAN-CS-75-486*BJORCK & GOLUB,EIGENPROBLEMS FOR MATRICES|0|0|$ 2.30
*CS487|STAN-CS-75-487*FRIEDMAN,VARIABLE METRIC DECISION|27|0|$ 2.70
*CS488|STAN-CS-75-488*BOLLOBAS ET AL.,R-CHROMATIC GRAPHS|42|0|$ 2.20
*CS489|STAN-CS-75-489*SZEMEREDI,REGULAR PARTITIONS OF GRAPHS|47|0|$ 1.90
*CS490|STAN-CS-75-490*GOSPER,NUMERICAL EXPERIMENTS|25|0|$ 2.60
*CS491|STAN-CS-75-492*KNOTT,DELETION BINARY STOR TREES (THESIS)|0|0|$ .00
*CS492|STAN-CS-75-492*SEDGEWICK,QUICKSORT|0|0|$ .00
*CS493|STAN-CS-75-493*KURKI-SUONIO,DESCRIBING AUTOMATA|9|0|$ 2.80
*CS494|STAN-CS-75-494*SATTERTHWAITE,SOURCE LANG DEBUGGING TOOLS|0|0|$ .00
*CS495|STAN-CS-75-495*KROGDAHL,DEPENDENCE GRAPH|27|0|$ 2.60
*CS496|STAN-CS-75-496*UNDERWOOD,ITERAIVE BLOCK LANCZOS(THESIS)|0|0|$ 5.70
*CS497|STAN-CS-75-497*GRAHAM & LOVASZ,DISTANCE MATRICES OF TREES|40|0|$ 3.10
*CS498|STAN-CS-75-498*SAMET, AUTO PRVG CRCT TRNSLATNS INVLV CODE-THESIS|0|295|$ 7.70
*AIM259|SAME
*CS499|STAN-CS-75-499*SMITH, PYGMALION-THESIS|0|293|$ .00
*AIM260|SAME
*CS500|STAN-CS-75-500*KURKI-SUONIO,TOWARDS BETTER DEFINITIONS|0|0|$ .00
*CS501|STAN-CS-75-501*PETTERSEN, PROCDRAL EVNTS AS SOFTWARE INTERRUPTS|60|297|$ 1.95
*AIM261|SAME
*CS502|STAN-CS-75-502*PETTERSEN, SYNCHRONIZATION OF CONCURRENT PROCES|54|296|$ 2.10
*AIM262|SAME
*CS503|STAN-CS-75-503*PETTERSEN, MACRO PROCESSING SYSTEM STAGE2|109|298|$ 2.25
*AIM263|SAME
*CS504|STAN-CS-75-504*SZEMEREDI,ON SPARSE GRAPHS WITH PATHS|22|0|$ 1.85
*CS505|STAN-CS-75-505*CHVATAL,LINEAR PROGRAMMING ASPECTS|9|0|$ 2.60
*CS506|STAN-CS-75-506*GORDON, OPERATION REASON & DENOTATION SEMANTICS|97|296|$ 2.65
*AIM264|SAME
*CS507|STAN-CS-75-507*GORDON, TWRDS SEMANTIC THEORY DYNAMIC BINDG|109|297|$ 2.50
*AIM265|SAME
*CS508|STAN-CS-75-508*EVE,TRANSITIVE CLOSURE RELATION|2|0|$ 1.85
*CS509|STAN-CS-75-509*OVERTON & PROSKUROWSKI,FIND MAXIMAL INCIDENCE|32|0|$ 3.90
*CS510|STAN-CS-75-510*YAO & KNUTH,ANALYSIS OF SUBTRACTIVE ALGORITHMS|90|0|$ 2.00
*CS511|STAN-CS-75-511*DUBOST & TROUSSE,SOFTWARE IMPLEMENTATION|5|0|$ 2.75
*CS512|STAN-CS-75-512*TARJAN,APPLICATIONS PATH COMPRESSION|0|0|$ .00
*CS513|STAN-CS-75-513*BENTLEY,FIXED RADIUS NEAR NEIGHBOR SEARCHING|31|0|$ 2.60
*CS514|STAN-CS-75-514*TOKURA,MICROPROGRAM CONTROL UNIT|0|0|$ .00
*CS515|STAN-CS-75-515*BRENT,MULTIPLE-PRECISION EVALUATION|16|0|$ 2.35
*CS516|STAN-CS-75-516*STOER,QUADRATIC TERMINATION & CONVERGENCE PROPERTIES|0|0|$ .00
*CS517|STAN-CS-75-517*DAVIS ET AL, RULES KNLDG-BASE CONSULT PRGRM|136|296|$ 2.75
*AIM266|SAME
*CS518|STAN-CS-75-518*CHVATAL & HAMMER,AGGREGATION OF INEQUALITIES|16|0|$ 2.50
*CS520|STAN-CS-75-520*V.HENKE, DATA STRUCTURES IN LCF|293|298|$ 2.85
*AIM267|SAME
*CS521|STAN-CS-75-521*THOMPSON, DEPTH PERCEPTION STEREO CMPTR VSN|223|298|$ 2.15
*AIM268|SAME
*CS522|STAN-CS-75-522*LUCKHAM ET AL, AUTO PROGRAM VERIFICATION IV|175|296|$ 2.50
*AIM269|SAME
*CS523|STAN-CS-75-523*REISER, BAIL|0|293|$ 2.45
*AIM270|SAME
*CS524|STAN-CS-75-524*DAVIS & KING, OVERVIEW OF PRODUCTION SYSTEMS|0|250|$ 2.85
*AIM271|SAME
*CS525|STAN-CS-75-525*GANAPATHY, SCENES CONTAINING POLYHEDRA-THESIS|22|297|$ 7.40
*AIM272|SAME
*CS526|STAN-CS-75-526*TARJAN,GRAPH THEORY|0|0|$ .00
*CS527|STAN-CS-75-527*MCCLUSKEY ET AL.,CURRENT RES CEN RELIABLE COMP|0|0|$ .00
*CS528|STAN-CS-75-528*TARJAN,SOLVING PATH PROBLEMS ON DIRECTED GRAPHS|0|0|$ .00
*CS529|STAN-CS-75-529*BENTLEY & FRIEDMAN,FAST ALGORITHMS|9|0|$ 2.60
*CS530|STAN-CS-75-530*LENTINI & PEREYRA,DIFFERENCE SOLVER BOUNDARY PROBLEMS|2|0|$ 3.00
*CS531|STAN-CS-75-531*ROSE & TARJAN,ALGORITHMIC ASPECTS VERTEX ELIMINATION|0|0|$ .00
*CS532|STAN-CS-75-532*JACOBS,BIBLIOGRAPHY CSD TECH REPORTS|334|0|$ .00
*CS533|STAN-CS-75-533*CONCUS ET AL.,GENERAL CONJ GRAD METHOD|11|0|$ 2.40
*CS534|STAN-CS-75-534*HEMPHILL, SPRCH TO AUTO LANG UNDRSTD & BLF-THESIS|0|293|$ .00
*AIM273|SAME
*CS535|STAN-CS-76-535*CONCUS & GOLUB, GENERALIZED CONJUGATE GRADIENT |2|0|$ 2.05
*CS536|STAN-CS-75-536*GROSSMAN & TAYLOR, GNRTN OBJCT MDLS W/MANIPLATR|218|298|$ 2.60
*AIM274|SAME
*CS537|STAN-CS-75-537*BOLLES, VSN WITHIN PRGRMBL ASSY SYS|80|298|$ 4.00
*AIM275|SAME
*CS538|STAN-CS-75-538*KNUTH & TRABB PARDO,ANALYSIS OF FACTORIZATION ALGORITHM|68|0|$ 3.00
*CS539|STAN-CS-75-539*MANNA & SHAMIR, NEW APRCH TO RECURSIVE PRGRMS|152|297|$ 2.40
*AIM276|SAME
*CS540|STAN-CS-76-540*GRAHAM ET AL.,ADDITION CHAINS|35|0|$ 1.90
*CS541|STAN-CS-76-541*KNUTH,MATH & COMPUTER SCIENCE:COPING WITH FINITENESS|0|0|$ .00
*CS542|STAN-CS-76-542*MANNA & SHAMIR, THEORY ASPECTS  OF OPTIMAL FXDPT|0|291|$ 2.45
*AIM277|SAME
*CS543|STAN-CS-76-543*ZAVE,OPTIMAL POLYPHASE SORTING|0|0|$ .00
*CS544|STAN-CS-76-544*MONT-REYNAUD,REMOVING TRIVIAL ASSIGNMENTS|0|0|$ .00
*CS545|STAN-CS-76-545*PAUL,TARJAN & CELONI,SPACE BOUNDS|53|0|$ 2.35
*CS546|STAN-CS-76-546*BASKETT & SHUSTEK,VIDEO GRAPHICS TERMINAL|16|0|$ 2.45
*CS547|STAN-CS-76-547*TARJAN,ITERATIVE ALGORITHMS FOR GLOBAL FLOW ANALYSIS|46|0|$ 2.60
*CS548|STAN-CS-76-548*O'LEARY,HYBRID CONJUGATE GRAD ALGORITHMS|0|0|$ .00
*CS549|STAN-CS-76-549*LUCKHAM & SUZUKI, AUTO PRGRM VERIFICATION V|132|294|$ 3.05
*AIM278|SAME
*CS550|STAN-CS-76-550*TARJAN & TROJANOWSKI,FINDING MAX INDEPENDENT SET|54|0|$ 2.35
*CS551|STAN-CS-76-551*KNUTH,STATE OF ART OF COMPUTER PROGRAMMING|0|0|$ 3.40
*CS552|STAN-CS-76-552*SUZUKI, AUTO VRFCT PRGRM W/CMPLX DATA-THESIS|0|279|$ 7.15
*AIM279|SAME
*CS553|STAN-CS-76-553*TARJAN,COMPLEXITY OF MONOTONE NETWORKS|24|0|$ 2.35
*CS554|STAN-CS-76-554*YU,MODELING WRITE BEHAVIOR(THESIS)|7|0|$ 7.25
*CS555|STAN-CS-76-555*GROSSMAN,TOLERANCING IN DISCR PARTS MFG & ASSEMBLY|365|246|$ 2.40
*AIM280|SAME
*CS556|STAN-CS-76-556*GUIBAS,ANALYSIS OF HASHING ALGORITHMS(THESIS)|228|177|$ 5.55
*CS557|STAN-CS-76-557*PATERSON,INTRO TO BOOLEAN FUNCTION COMPLEXITY|224|178|$ 2.25
*CS558|STAN-CS-77-558*MANNA & WALDINGER, IS `SOMETIME' SOMETIMES BETTER?|182|82|$ 2.85
*AIM281.1|SAME
*CS559|STAN-CS-76-559*GOLUB ET AL,RANK DEGENERACY AND LEAST SQUARES|0|197|$ 2.75
*CS560|STAN-CS-76-560*TAYLOR,SYNTHESIS OF MANIPULATOR CNTRL PROGRMS(THESIS)|144|483|$ 8.10
*AIM282|SAME
*CS561|STAN-CS-76-561*WOODS,MATH PROG LANGUAGE: USER'S GUIDE|14|195|$ .00
*CS562|STAN-CS-76-562*KNUTH,TRABB PARDO,EARLY DEVEL OF PROG LANGUAGES|138|184|$ 3.50
*CS563|STAN-CS-76-563*RUSSELL,STATE RESTORATION|0|0|$ .00
*CS564|STAN-CS-76-564*DAVIS,APPL OF META KNOWLEDGE TO LARGE KNOWLG BASES(THESIS)|0|304|$ .00
*AIM283|SAME
*CS565|STAN-CS-76-565*STRIKWERDA,BOUNDARY VALUE PROBLEMS(THESIS)|7|518|$ .00
*CS566|STAN-CS-76-566*WRIGHT,NUMERICAL METHODS(THESIS)|0|455|$ .00
*CS567|STAN-CS-76-567*FINKEL,CONSTRUCT & DEBUG MANIPULATOR PROGRAMS-THESIS|12|233|$ .00
*AIM284|SAME
*CS568|STAN-CS-77-568*BINFORD ET AL,EXPLOR STDY ASSY SYS,PRGRS RPT 4|160|74|$ 11.80
*AIM285.4|SAME
*CS569|STAN-CS-76-569*HERRIOT,INTERPOLATING NATURAL SPLINE FUNCTIONS|149|215|$ 3.10
*CS570|STAN-CS-76-570*LENAT, AM: A.I. APPROACH TO DISCOVERIN IN MATH-THESIS|0|298|$ .00
*AIM286|SAME
*CS571|STAN-CS-76-571*RODERICK, DISCRETE CONTROL OF A ROBOT ARM-THESIS|105|203|$ 4.45
*AIM287|SAME
*CS572|STAM-CS-76-572*FILMAN, WEYHRAUCH, FOL PRIMER|52|171|$ 2.70
*AIM288|SAME
*CS573|STAN-CS-76-573*JONASSEN,STATIONARY P-TREE FOREST|120|227|$ 4.40
*CS574|STAN-CS-76-574*REISER, SAIL|618|78|$ 6.70
*AIM289|SAME
*CS575|STAN-CS-76-575*SMITH, SAIL TUTORIAL|694|132|$ 3.20
*AIM290|SAME
*CS576|STAN-CS-76-576*MCDIARMID,CHROMATIC NUMBER OF A GRAPH|89|212|$ 3.55
*CS577|STAN-CS-76-577*BUCHANAN ET AL, 3 REVUS WEIZENBAUM'S CMPTR PWR & RSNG|0|91|$ 2.50
*AIM291|SAME
*CS578|STAN-CS-76-578*OLIGER & SUNDSTROM,INITIAL-BOUNDARY PROBLEMS|31|499|$ .00
*CS579|STAN-CS-76-579*BASKETT & RAFII,A0 INVERSION MODEL|211|214|$ 2.60
*CS580|STAN-CS-76-580*WINOGRAD, TWRDS PROCEDURAL UNDRSTNDG OF SEMANTICS|106|70|$ 2.55
*AIM292|SAME
*CS581|STAN-CS-76-581*BOBROW & WINOGRAD, OVERVIEW OF KRL|0|39|$ 2.85
*AIM293|SAME
*CS582|STAN-CS-76-582*CHVATAL ET AL.,RESULTS CONCERN MULTICOLORING|84|220|$ 1.95
*CS583|STAN-CS-76-583*CHVATAL,DETERMINING STABILITY NUMBER|56|214|$ 2.80
*CS584|STAN-CS-76-584*KNUTH,DELETIONS THAT PRESERVE|8|153|$ 2.60
*CS585|STAN-CS-76-585*CONCUS ET AL.,NUMERICAL SOLUTION|0|130|$ .00
*CS586|STAN-CS-76-586*DERSHOWITZ & MANNA, EVOLUTION OF PROGRAMS|130|99|$ 2.95
*AIM294|SAME
*CS587|STAN-CS-77-587*GAREY ET AL.,COMPLEXITY RESULTS|44|185|$ 2.70
*CS588|STAN-CS-77-588*CHAN,SINGULAR VALUE DECOMPOSITION|0|123|$ .00
*CS589|STAN-CS-77-589*ENGELMORE & NII,KNOWLEDGE-BASED SYSTEM|91|191|$ 2.70
*CS590|STAN-CS-77-590*KNUTH & PATERSON,PARTITION INVOLUTIONS|2|114|$ 2.35
*CS591|STAN-CS-76-591*BOLLES, VERIFY VISION W/PRGRM ASSEMBLY SYS-THESIS|229|166|$ 8.55
*AIM295|SAME
*CS592|STAN-CS-76-592*CARTWRIGHT, FORML DEMNT DEF & VER SYS LISP-THESIS|74|98|$ 6.15
*AIM296|SAME
*CS594|STAN-CS-77-594*STRITTER,FILE MIGRATION(THESIS)|14|13|$ 4.85
*CS595|STAN-CS-77-595*LEWIS,SPARSE MATRIX EIGENVALUE(THESIS)|7|97|$ .00
*CS598|STAN-CS-77-598*JONASSEN & KNUTH,TRIVIAL ALGORITHM|7|0|$ 2.60
*CS599|STAN-CS-77-599*KNUTH & SCHONHAGE,EXPECTED LINEARITY|5|36|$ 3.30
*CS600|STAN-CS-77-600*BROWN,ANALYSIS OF PRIORITY QUEUE(THESIS)|0|47|$ 4.55
*CS601|STAN-CS-77-601*REISER,RANDOM NUMBER GENERATORS(THESIS)|2|74|$ 2.65
*CS602|STAN-CS-77-602*DE BOOR & GOLUB,NUMERICALLY STABLE RECONSTRUCTION|0|25|$ .00
*CS603|STAN-CS-77-603*TARJAN,REFERENCE MACHINES|49|74|$ 2.95
*CS604|STAN-CS-77-604*CHAN & OLIGER,CONTROL OF DISSIPATIVITY|0|65|$ .00
*CS606|STAN-CS-77-606*CLANCY & KNUTH,PROGRAMMING SEMINAR|0|18|$ 4.60
*CS607|STAN-CS-77-607*OWICKI,SPECIFICATIONS & PROOFS|76|95|$ 2.45
*CS608|STAN-CS-77-608*SIMON,SUBRECURSIVE REDUCIBILITIES(THESIS)|0|177|$ .00
*CS609|STAN-CS-77-609*TARJAN,COMBINATORIAL ALGORITHMS|37|93|$ 4.15
*CS610|STAN-CS-77-610*WINOGRAD, FRAMEWORK FOR UNDERSTANDING DISCOURSE|0|52|$ 2.40
*AIM297|SAME
*CS611|STAN-CS-77-611*MANNA & WALDINGER, LOGIC OF COMPUTER PROGRAMMING|0|33|$ 4.25
*AIM298|SAME
*CS612|SAME
*CS613|STAN-CS-77-613*SPEDICATO,QUASI-NEWTON METHODS|162|178|$ 2.60
*CS614|STAN-CS-77-614*MANNA & SHAMIR, CONVERG FUNCTIONS TO FIXEDPOINTS|108|159|$ 2.95
*AIM299|SAME
*CS615|STAN-CS-77-615*GLOWINSKI & PIRONNEAU,NUMERICAL METHODS|0|164|$ .00
*HPP-77-1|HPP-77-1*SCOTT ET AL.,EXPLANATION CAPABILITIES|1|50|$ 2.55
*HPP-77-5|HPP-77-5*STEFIK & MARTIN,KNOWLDGE BASED PROBLEM SOLVING|22|67|$ 4.40
*HPP-77-6|HPP-77-6*BUCHANAN & MITCHELL,MODEL-DIRECTED LEARNING|49|54|$ 2.30
*HPP-77-7|HPP-77-7*NII & FEIGENBAUM,RULE-BASED UNDERSTANDING|105|179|$ 2.35
*HPP-77-14|HPP-77-14*SMITH ET AL.,MODEL LEARNING SYSTEMS|0|132|$ 2.30
*Y|SAME
*CS616|STAN-CS-77-616*KREISS & OLIGER,STABILITY OF FOURIER METHOD|0|147|$ .00
*HPP-77-28|HPP-77-28*NILSSON,PRODUCTION SYSTEM AUTO DEDUCTION|12|115|$ 2.90
*STAN-CS-77-618|SAME
*CS619|STAN-CS-77-619*PAUL & TARJAN,TIME-SPACE TRADE-OFFS|51|197|$ 1.90
*CS620|STAN-CS-77-620*BOLSTAD & OLIGER,ADAPTATION OF FOURIER METHOD|0|0|$ .00
*HPP-77-25|HPP-77-25*FEIGENBAUM,ART OF ARTIFICIAL INTELLIGENCE|96|78|$ 2.20
*STAN-CS-77-621|SAME
*CS622|STAN-CS-77-622*GOLUB ET AL.,GENERALIZED CROSS-VALIDATION|0|157|$ .00
*CS623|STAN-CS-77-623*BOLEY & GOLUB,INVERSE EIGENVALUE PROBLEMS|0|120|$ .00
*CS625|STAN-CS-77-625*BROWN & TARJAN,FAST MERGING ALGORITHM|120|152|$ 2.90
*CS617|STAN-CS-77-617*WINOGRAD, SOME CONTSTD SUPOSTONS...STDY OF LNGAGE|0|52|$ 2.40
*AIM300|SAME
*CS624|STAN-CS-77-624*EARNEST ET AL, RECENT RESEARCH IN COMPUTER SCIENCE|98|0|$ 5.00
*AIM301|SAME
*CS632|STAN-CS-77-632*WAGNER, HARDWARE VERIFICATION (THESIS)|72|126|$ 4.55
*AIM304|SAME
*CS633|STAN-CS-77-633*FAUGHT, MOTIVTN & INTNSONALTY IN COMP. SIMLTON MODEL (THESIS)|50|142|$ 4.60
*AIM305|SAME
*AIM235.1|AIM-235.1*WEYHRAUCH, A USER'S MANUAL FOR "FOL"|113|162|$ 3.30
*CS432|SAME
*AIM285|STAN-CS-76-568*BINFORD ET AL, EXPLOR STDY ASSY SYS, PRGRS RPT3|0|148|$ .00
*CS568|SAME
*CS626|STAN-CS-77-626*YAO, LOOP SWITCHING ADDRESSING PROBLEM|108|189|$ 2.30
*CS627|STAN-CS-77-627*LIPTON & TARJAN, SEPARATOR THEOREM|120|174|$ 2.60
*CS628|STAN-CS-77-628*LIPTON & TARJAN, APPLICATIONS SEPARATOR THEOREM|118|175|$ 2.65
*CS629|STAN-CS-77-629*YAO, PATTERN MATCHING RANDOM STRING|70|157|$ 2.90
*CS634|STAN-CS-77-634*HOFFMANN & PARLETT, GLOBAL CONVERGENCE|0|108|$ .00
*CS635|STAN-CS-77-635*GOLUB ET AL.,  BLOCK LANCZOS METHOD|0|100|$ .00
*CS636|STAN-CS-77-636*BUBE, Cm CONVERGENCE TRIG INTERPOLANTS|0|169|$ .00
*V. 4|KNUTH, THE ART OF COMPUTER PROGRAMMING, VOLUME 4 (Preprint)|55|0|$ 2.00
*CS630|STAN-CS-77-630*MANNA & WALDINGER, SYNTHESIS: DREAMS => PROGRAMS|120|71|$ 5.05
*AIM302|SAME
*CS631|STAN-CS-77-631*MANNA & DERSHOWITZ, INFERANCE RULS...PRGRM ANOTATN|0|97|$ 3.00
*AIM303|SAME
*509|STAN-CS-75-509*OVERTON & PROSKUROSKI, FINDING MAXIMAL INCIDENCE:|6|0|$ 3.70
*THE STATE OF THE ART OF COMPUTER PROG.|KNUTH,THE STATE OF THE ART OF COMPUTER PROGRAMMING|0|0|$ .00
*.|SAME
*CS639|STAN-CS-77-639*GREEN & BARSTOW, ON PROGRAM SYNTHESIS KNOWLEDGE|204|146|$ 3.45
*AIM306|SAME
*CS640|STAN-CS-77-640*MANNA & WALDINGER, STRCTRD PRGRMNG W/O RECURSION|117|149|$ 2.00
*AIM307|SAME
*CS641|STAN-CS-77-641*BARSTOW, AUTOMATIC CONSTRUCTION OF ALGORITHMS (THESIS)|0|295|$ 8.30
*AIM308|SAME
*CS646|STAN-CS-77-646*NELSON & OPPEN, EFCNT DECSION PROCDRS BASED ON CONGRUNCE CLSR|171|217|$ 2.50
*AIM309|SAME
*CS637|L.RAMSHAW,ON THE GAP STRUCTURE OF SEQUENCES OF POINTS ON A CIRCLE|152|200|$ 2.45
*CS638|D.O'LEARY,A GENERALIZED CONJUGATE GRADIENT ALGORITHM FOR SOLVING A CLASS OF PROGRAMMING PROBLEMS|17|214|$ .00
*CS642|A.YAO,ON CONSTRUCTING MINIMUM SPANNING TREES IN k-DIMENSIONAL SPACES AND RELATED PROBLEMS|89|161|$ 2.75
*CS643|K.TANABE,A GEOMETRIC METHOD IN NONLINEAR PROGRAMMING|15|179|$ .00
*CS644|B.MONT-REYNAUD,HIERARCHICA PROPERTIES OF FLOWS & THE DETERMINATION OF INNER LOOPS(THESIS)|94|202|$ 6.30
*CS645|STAN-CS-78-645*R.LIPTON,D.ROSE&R.TARJAN,GENERLIZED NESTED DISSECTION|146|188|$ 2.60
*CS647|STAN-77-647*A.YAO,A LOWER BOUND TO PALINDROME RECONGITION BY PROBABILISTIC TURING MACHINES|55|149|$ 2.25
*CS596|STAN-CS-77-596*M.STEFIK&N.MARTING,A REVIEW OF KNOWLEDGE BASED PROBLEM SOLVING AS A BASIS FOR A GENETICS EXPERIEMENT DESIGNING SYSTEM|22|100|$ 2.75
*HPP-77-5|SAME